On Computing the Gromov Hyperbolicity (Q2828207): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: 1-Hyperbolic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to clique minimal separator decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hyperbolicity of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Split Decomposition Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and distance and routing labeling schemes for hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying clique-decomposition for computing Gromov hyperbolicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Modularity of Some Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Phylogenetic Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Gromov hyperbolicity of a discrete metric space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaled Gromov four-point condition for network graph curvature computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the longest isometric cycle in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of empirically tight bounds for the diameter of massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3173678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolicity and chordality of a graph / rank
 
Normal rank

Latest revision as of 18:51, 12 July 2024

scientific article
Language Label Description Also known as
English
On Computing the Gromov Hyperbolicity
scientific article

    Statements

    On Computing the Gromov Hyperbolicity (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2016
    0 references
    algorithms
    0 references
    Gromov hyperbolicity
    0 references
    networks
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references