Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMath1171.68587MaRDI QIDQ5897550

No author found.

Publication date: 1 November 2006

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

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (28)

All metric bases and fault-tolerant metric dimension for square of grid ⋮ Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ Near-Linear Query Complexity for Graph Inference ⋮ The metric dimension for resolving several objects ⋮ Computing the metric dimension of convex polytopes generated by wheel related graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ The \(k\)-metric dimension ⋮ Partition dimension of rooted product graphs ⋮ Fault-tolerant strong metric dimension of graphs ⋮ Partition dimension of certain classes of series parallel graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Metric dimension of Andrásfai graphs ⋮ A note on the complexity of \(k\)\textsc{-metric dimension} ⋮ Learning and Verifying Graphs Using Queries with a Focus on Edge Counting ⋮ Unnamed Item ⋮ Reconstruction and verification of chordal graphs with a distance oracle ⋮ On Approximation Complexity of Metric Dimension Problem ⋮ Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension ⋮ On the metric dimension of infinite graphs ⋮ Metric dimension parameterized by treewidth ⋮ Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries ⋮ Unnamed Item ⋮ Minimum weight resolving sets of grid graphs ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Annihilating-ideal graphs of commutative rings ⋮ On graphs with same metric and upper dimension ⋮ On the metric dimensions for sets of vertices

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