Distance-Preserving Graph Contractions (Q5233754): 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 4/3 additive spanner exponent is tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling via Integer Programs with Circular Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic decremental single source shortest paths: beyond the o(mn) bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Preserving Graph Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Preserving Graph Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Size Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Lower Bound for the Steiner Point Removal Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sourcewise and Pairwise Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Resistance Sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kron Reduction of Graphs With Applications to Electrical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling random spanning trees faster than matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Terminal Distances Using Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Revision as of 08:57, 20 July 2024

scientific article; zbMATH DE number 7101961
Language Label Description Also known as
English
Distance-Preserving Graph Contractions
scientific article; zbMATH DE number 7101961

    Statements

    Distance-Preserving Graph Contractions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 September 2019
    0 references
    spanner
    0 references
    contraction
    0 references
    distance oracle
    0 references
    graph compression
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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