Cover Image

Efficient Reconstruction of Arboreal Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huber, Katharina T., John, Katherine St.
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)

Semi-Random Graphs, Robust Asymmetry, and Reconstruction
by: Asilis, Julian, et al.
Published: (2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)

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

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

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

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

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

Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
by: Moses Jr., William K., et al.
Published: (2025)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Constrained Flows in Networks
by: Bessy, Stéphane, et al.
Published: (2023)

Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
by: Bharadwaj, et al.
Published: (2025)

Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
by: Yang, Yaoyu, et al.
Published: (2024)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
by: Dai, Wenkai, et al.
Published: (2024)

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

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

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)

Efficient Computation in Congested Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2023)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
by: Zhu, Enqiang, et al.
Published: (2025)

Efficient Lifting of Discrete Logarithms Modulo Prime Powers
by: Viglietta, Giovanni, et al.
Published: (2025)

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

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Pathway Realisability in Chemical Networks
by: Andersen, Jakob L., et al.
Published: (2023)

Mixed Unit Interval Bigraphs : A Characterization
by: Das, Ashok Kumar, et al.
Published: (2026)

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
by: Porreca, Antonio E., et al.
Published: (2026)

A Boolean encoding of the Most Permissive semantics for Boolean networks
by: de Chancel, Laure, et al.
Published: (2026)

Binary constraints on one additional variable can create exponential ascents
by: Cohen, David A., et al.
Published: (2026)

Positional Identifiability from Pairwise Collision Data
by: Li, Yun-Han, et al.
Published: (2026)

Multipacking on graphs and Euclidean metric space
by: Islam, Sk Samim
Published: (2026)

Majority Boolean networks classifying density: structural characterization and complexity
by: Perrot, Kévin, et al.
Published: (2026)

The Balanced Up-Down Walk
by: Akitaya, Hugo A., et al.
Published: (2026)

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

Another Way to Lower the Bound for Distinct Squares
by: Tomita, Eitatsu, et al.
Published: (2026)

Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, et al.
Published: (2026)