scientific article; zbMATH DE number 7740923

DOI10.4230/lipics.esa.2021.68arXiv2112.04549MaRDI QIDQ6075963

Hang Zhou, Claire Mathieu

Publication date: 20 September 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.04549

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random regular graphsreconstructionmetric dimensionnetwork topology

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computer science (68-XX) Combinatorics (05-XX)

Related Items (1)

Exact learning of multitrees and almost-trees using path queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metric dimension for random graphs
• Bounds for identifying codes in terms of degree parameters
• The strong metric dimension of graphs and digraphs
• Codes identifying sets of vertices in random networks
• The simultaneous metric dimension of graph families
• An optimal algorithm to reconstruct trees from additive distance data
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Resolvability in graphs and the metric dimension of a graph
• Reconstruction and verification of chordal graphs with a distance oracle
• On the limiting distribution of the metric dimension for random forests
• Landmarks in graphs
• Topology discovery of sparse random graphs with few participants
• Emergence of Scaling in Random Networks
• Base size, metric dimension and other invariants of groups and graphs
• The Covert Set-Cover Problem with Application to Network Discovery
• Network Discovery and Verification with Distance Queries
• On the Metric Dimension of Cartesian Products of Graphs
• Extremal Graph Theory for Metric Dimension and Diameter
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Approximate Discovery of Random Graphs
• Distinguishing Vertices of Random Graphs
• On a new class of codes for identifying vertices in graphs
• Random graph models of social networks
• Graph reconstruction with a betweenness oracle
• Graph Reconstruction and Verification
• Determining the Evolutionary Tree Using Experiments
• Seeded graph matching via large neighborhood statistics
• On Metric Generators of Graphs
• On the bias of traceroute sampling

This page was built for publication: