scientific article; zbMATH DE number 1953095
From MaRDI portal
Publication:4414499
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Recommendations
- Complexity of approximating the oriented diameter of chordal graphs
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter
- scientific article; zbMATH DE number 3991530
- Diameters of iterated clique graphs of chordal graphs
- On the parameterized approximability of contraction to classes of chordal graphs
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- Towards tight approximation bounds for graph diameter and eccentricities
- Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
- Approximate distance oracle in \(O(n ^{2})\) time and \(O(n)\) space for chordal graphs
Cited in
(7)- Algorithms for graphs with small octopus
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter
- Minimizing the oriented diameter of a planar graph
- Complexity of approximating the oriented diameter of chordal graphs
- Bounds for the oriented diameter of planar triangulations
- On the oriented diameter of planar triangulations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414499)
