Applying clique-decomposition for computing Gromov hyperbolicity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 4095519 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- An introduction to clique minimal separator decomposition
- Approximation algorithms for NP-complete problems on planar graphs
- Characterizations of outerplanar graphs
- Collective dynamics of `small-world' networks
- Computing the Gromov hyperbolicity of a discrete metric space
- Core congestion is inherent in hyperbolic networks
- Decomposition by clique separators
- Decomposition of Directed Graphs
- Depth-First Search and Linear Graph Algorithms
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Distance-hereditary graphs
- Distortion of the hyperbolicity constant of a graph
- Finding four-node subgraphs in triangle time
- Graph theory with applications
- Gromov hyperbolic graphs
- Hyperbolic bridged graphs
- Hyperbolicity and chordality of a graph
- Into the square: on the complexity of some quadratic-time solvable problems
- Metric embedding, hyperbolic space, and social networks
- Minimal separators of 2-chordal graphs
- On bridged graphs and cop-win graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On computing the Gromov hyperbolicity
- On computing the hyperbolicity of real-world graphs
- On metric properties of certain clique graphs
- On the hyperbolicity of chordal graphs
- Optimal decomposition by clique separators
- Organizing the atoms of the clique separator decomposition into an atom tree
- Partition refinement techniques: an interesting algorithmic tool kit
- Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
- Recognizing quasi-triangulated graphs.
- SOFSEM 2005: Theory and Practice of Computer Science
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Three Partition Refinement Algorithms
- Transitiv orientierbare Graphen
- Tree-Like Structures in Graphs: A Metric Point of View
- Tree-decompositions with bags of small diameter
Cited in
(8)- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- When can graph hyperbolicity be computed in linear time?
- When can graph hyperbolicity be computed in linear time?
- Obstructions to a small hyperbolicity in Helly graphs
- Leanness computation: small values and special graph classes
- Revisiting decomposition by clique separators
- On computing the hyperbolicity of real-world graphs
- On computing the Gromov hyperbolicity
This page was built for publication: Applying clique-decomposition for computing Gromov hyperbolicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399620)
