Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The minimum vulnerability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Algorithms for Unique Games and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Graph Partitioning and Small Set Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders are not hyperbolic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesics and almost geodesic cycles in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic 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: Packing and Covering δ-Hyperbolic Spaces by Balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Geometric Routing Using Hyperbolic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On network design problems: fixed cost flows and the covering steiner problem / 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: On set expansion problems and the small set expansion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaled Gromov hyperbolic graphs / 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: Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks / 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: Finding paths with minimum shared edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for the isoperimetric and spectral profile of graphs and related parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 10:44, 15 July 2024

scientific article
Language Label Description Also known as
English
Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
scientific article

    Statements

    Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Gromov hyperbolicity
    0 references
    node expansion
    0 references
    minimum cuts
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references