Image de couverture de livre

Efficient Reconstruction of Arboreal Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huber, Katharina T., John, Katherine St.
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph Reconstruction with Connectivity Queries
par: Kluk, Kacper, et autres
Publié: (2024)

Semi-Random Graphs, Robust Asymmetry, and Reconstruction
par: Asilis, Julian, et autres
Publié: (2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
par: Zhou, Xiaotian, et autres
Publié: (2025)

Graph Theoretic Investigations on Inefficiencies in Network Models
par: Cenciarelli, Pietro, et autres
Publié: (2016)

Reducing Sensor Requirements by Relaxing the Network Metric Dimension
par: Mürmann, Paula, et autres
Publié: (2025)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
par: Matuschke, Jannik
Publié: (2025)

Dynamical Stability of Threshold Networks over Undirected Signed Graphs
par: Goles, Eric, et autres
Publié: (2023)

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks
par: Frasser, Carlos E.
Publié: (2017)

Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
par: Moses Jr., William K., et autres
Publié: (2025)

An Efficient Genus Algorithm Based on Graph Rotations
par: Metzger, Alexander, et autres
Publié: (2024)

Constrained Flows in Networks
par: Bessy, Stéphane, et autres
Publié: (2023)

Efficient counting of permutation patterns via double posets
par: Diehl, Joscha, et autres
Publié: (2024)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
par: Bharadwaj, et autres
Publié: (2025)

Efficient polynomial-time approximation scheme for the genus of dense graphs
par: Jing, Yifan, et autres
Publié: (2020)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
par: Yang, Yaoyu, et autres
Publié: (2024)

Approximating the Network Design Problem for Potential-Based Flows
par: Klimm, Max, et autres
Publié: (2026)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
par: Dai, Wenkai, et autres
Publié: (2024)

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
par: Lindeberg, Anna, et autres
Publié: (2025)

Network fault costs based on minimum leaf spanning trees
par: Goedgebeur, Jan, et autres
Publié: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
par: Lindeberg, Anna, et autres
Publié: (2024)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

An improvement on the bound for the acyclic chromatic index
par: Kirousis, Lefteris, et autres
Publié: (2026)

Vertex Ranking of Degenerate Graphs
par: Iacono, John, et autres
Publié: (2024)

Efficient Computation in Congested Anonymous Dynamic Networks
par: Di Luna, Giuseppe A., et autres
Publié: (2023)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
par: Zhu, Enqiang, et autres
Publié: (2025)

Efficient Lifting of Discrete Logarithms Modulo Prime Powers
par: Viglietta, Giovanni, et autres
Publié: (2025)

Binary Weight Allocation for Multi-Objective Path Optimization: Efficient Earliest and Latest Path Discovery in Network Systems
par: Yeh, Wei-Chang
Publié: (2025)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Pathway Realisability in Chemical Networks
par: Andersen, Jakob L., et autres
Publié: (2023)

Mixed Unit Interval Bigraphs : A Characterization
par: Das, Ashok Kumar, et autres
Publié: (2026)

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
par: Porreca, Antonio E., et autres
Publié: (2026)

A Boolean encoding of the Most Permissive semantics for Boolean networks
par: de Chancel, Laure, et autres
Publié: (2026)

Binary constraints on one additional variable can create exponential ascents
par: Cohen, David A., et autres
Publié: (2026)

Positional Identifiability from Pairwise Collision Data
par: Li, Yun-Han, et autres
Publié: (2026)

Multipacking on graphs and Euclidean metric space
par: Islam, Sk Samim
Publié: (2026)

Majority Boolean networks classifying density: structural characterization and complexity
par: Perrot, Kévin, et autres
Publié: (2026)

The Balanced Up-Down Walk
par: Akitaya, Hugo A., et autres
Publié: (2026)

On the existence of heavy columns in binary matrices with distinct rows
par: Abdurakhmanov, Jamolidin K.
Publié: (2026)

Another Way to Lower the Bound for Distinct Squares
par: Tomita, Eitatsu, et autres
Publié: (2026)

Finding Minimal Clusters in st-DAGs
par: Vogl, Ulrich, et autres
Publié: (2026)