Imagen de Portada

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Frasser, Carlos E.
Formato:	Preprint
Publicado:	2017
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Block Designs and K-Geodetic Graphs: A Survey
por: Frasser, Carlos E.
Publicado: (2025)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
por: Frasser, Carlos E.
Publicado: (2026)

On a Problem of Ramsey Theory
por: Frasser, Carlos E.
Publicado: (2024)

A Course of Algebra (PART I)
por: Frasser, Carlos E.
Publicado: (2024)

Geodetic Graphs: Experiments and New Constructions
por: Stober, Florian, et al.
Publicado: (2023)

The Closed Geodetic Game: algorithms and strategies
por: Dailly, Antoine, et al.
Publicado: (2024)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

Efficient Classical Computation of Single-Qubit Marginal Measurement Probabilities to Simulate Certain Classes of Quantum Algorithms
por: Pradata, Santana Y., et al.
Publicado: (2024)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2024)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
por: Lindeberg, Anna, et al.
Publicado: (2024)

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
por: Hommelsheim, Felix, et al.
Publicado: (2026)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
por: Helleseth, Tor, et al.
Publicado: (2025)

Bipartite Powers of Certain Classes of Bipartite Graphs
por: Paul, Indrajit, et al.
Publicado: (2024)

Symbolic Listings as Computation
por: Sawczuk, Hamilton, et al.
Publicado: (2024)

Comparing Width Parameters on Graph Classes
por: Brettell, Nick, et al.
Publicado: (2023)

The only Class 0 Flower snark is the smallest
por: Bridi, Guilherme Adamatti, et al.
Publicado: (2025)

Computing Height-Optimal Tangles Faster
por: Firman, Oksana, et al.
Publicado: (2019)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
por: Tu, Ziran, et al.
Publicado: (2024)

Packing Topological Minors Half-Integrally
por: Liu, Chun-Hung
Publicado: (2017)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
por: Das, Sandip, et al.
Publicado: (2026)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
por: Kawamura, Akitoshi, et al.
Publicado: (2025)

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
por: Martin, Sébastien, et al.
Publicado: (2025)

Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
por: Parnas, Michal
Publicado: (2026)

Efficient Reconstruction of Arboreal Networks
por: Huber, Katharina T., et al.
Publicado: (2026)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
por: Bourneuf, Romain, et al.
Publicado: (2025)

Secure Domination in Bisplit graphs -- A Structural and algorithmic study
por: D, Swathi, et al.
Publicado: (2025)

Graph Theoretic Investigations on Inefficiencies in Network Models
por: Cenciarelli, Pietro, et al.
Publicado: (2016)

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
por: Karol, Nikolai, et al.
Publicado: (2026)

Reducing Sensor Requirements by Relaxing the Network Metric Dimension
por: Mürmann, Paula, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
por: Kurapov, Sergey, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Computing the clique number of tournaments
por: Aubian, Guillaume
Publicado: (2024)

The exact value of $c_1(K_{2,n})$
por: Mori, Hiroaki
Publicado: (2026)

On Approximate MMS Allocations on Restricted Graph Classes
por: Blažej, Václav, et al.
Publicado: (2025)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
por: Matuschke, Jannik
Publicado: (2025)

Dynamical Stability of Threshold Networks over Undirected Signed Graphs
por: Goles, Eric, et al.
Publicado: (2023)

An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks
por: Corcoran, Padraig, et al.
Publicado: (2025)