Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897550zbMATH OpenFDO

Authors

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Network Discovery and Verification with Distance Queries
• Discovery of network properties with all-shortest-paths queries
• Discovery of Network Properties with All-Shortest-Paths Queries
• Network verification via routing table queries
• Graph reconstruction and verification

Cited in

(34)

• Bounds on the domination number and the metric dimension of co-normal product of graphs
• Near-linear query complexity for graph inference
• Minimum weight resolving sets of grid graphs
• Approximate Discovery of Random Graphs
• Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
• Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
• On the metric dimensions for sets of vertices
• The metric dimension for resolving several objects
• On upper dimension of graphs and their bases sets
• Annihilating-ideal graphs of commutative rings
• Discovery of Network Properties with All-Shortest-Paths Queries
• scientific article; zbMATH DE number 7688341 (Why is no real title available?)
• On the metric dimension of infinite graphs
• Computing the metric dimension of convex polytopes generated by wheel related graphs
• Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
• Reconstruction and verification of chordal graphs with a distance oracle
• Network Discovery and Verification with Distance Queries
• The \(k\)-metric dimension
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Network verification via routing table queries
• Partition dimension of rooted product graphs
• Metric dimension parameterized by treewidth
• On graphs with same metric and upper dimension
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• Discovery of network properties with all-shortest-paths queries
• A note on the complexity of \(k\)\textsc{-metric dimension}
• Metric dimension of Andrásfai graphs
• All metric bases and fault-tolerant metric dimension for square of grid
• On approximation complexity of metric dimension problem
• The covert set-cover problem with application to network discovery
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• Fault-tolerant strong metric dimension of graphs
• Partition dimension of certain classes of series parallel graphs
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897550)