Leanness computation: small values and special graph classes
From MaRDI portal
Publication:6606996
DOI10.46298/DMTCS.12544zbMATH Open1547.05273MaRDI QIDQ6606996
Samuel Coulomb, David Coudert, Guillaume Ducoffe
Publication date: 17 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data center interconnection networks are not hyperbolic
- Hyperbolicity and chordality of a graph
- Into the square: on the complexity of some quadratic-time solvable problems
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Distance-hereditary graphs
- Complement reducible graphs
- Characterizations of outerplanar graphs
- Obstructions to a small hyperbolicity in Helly graphs
- Hyperbolic bridged graphs
- Strongly geodesically automatic groups are hyperbolic
- Applying clique-decomposition for computing Gromov hyperbolicity
- A new algorithm for optimal 2-constraint satisfaction and its implications
- On computing the Gromov hyperbolicity
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Weakly Modular Graphs and Nonpositive Curvature
- On Computing the Hyperbolicity of Real-World Graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- An algebraic characterization of geodetic graphs
- Core congestion is inherent in hyperbolic networks
- On the Structure of Unique Shortest Paths in Graphs
- On planar geodetic graphs
- On the hyperbolicity of chordal graphs
- On the complexity of \(k\)-SAT
- Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
- Computing graph hyperbolicity using dominating sets
- New bounds for matrix multiplication: from alpha to omega
This page was built for publication: Leanness computation: small values and special graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606996)