k-chordal graphs: from cops and robber to compact routing via treewidth
From MaRDI portal
(Redirected from Publication:494802)
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Recommendations
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs
- scientific article; zbMATH DE number 1953090
- scientific article; zbMATH DE number 2013835
- Distributed computing of efficient routing schemes in generalized chordal graphs
Cites work
- scientific article; zbMATH DE number 1665333 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 1511711 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 7051285 (Why is no real title available?)
- 1-Hyperbolic Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A bound for the cops and robbers problem
- A game of cops and robbers
- A partial k-arboretum of graphs with bounded treewidth
- A short note about pursuit games played on a graph with a given genus
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Collective dynamics of `small-world' networks
- Compact Routing in Power-Law Graphs
- Compact name-independent routing with minimum stretch
- Complexity of Finding Embeddings in a k-Tree
- Cop and robber games when the robber can hide and ride
- Cops and robbers in graphs with large girth and Cayley graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Distributed Computing
- Distributed computing of efficient routing schemes in generalized chordal graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph minors. III. Planar tree-width
- Hyperbolicity and chordality of a graph
- Monadic second-order evaluations on tree-decomposable graphs
- Object location using path separators
- On Meyniel's conjecture of the cop number
- On a pursuit game played on graphs for which a minor is excluded
- On the complexity of computing treelength
- Optimal-stretch name-independent compact routing in doubling metrics
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Tandem-win graphs
- The Pathwidth and Treewidth of Cographs
- The game of cops and robbers on graphs
- Tree-decompositions with bags of small diameter
- Treewidth for graphs with small chordality
- Treewidth of Chordal Bipartite Graphs
- Treewidth of Circular-Arc Graphs
- Vertex-to-vertex pursuit in a graph
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Cited in
(7)- Study of a combinatorial game in graphs through linear programming
- Pathlength of outerplanar graphs
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Tree-chromatic number
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Cops and robber on subclasses of \(P_5\)-free graphs
- Treelength of series-parallel graphs
This page was built for publication: \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494802)
