Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Merav Parter / rank
Normal rank
 
Property / author
 
Property / author: Merav Parter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809995963 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.6835 / 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: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sourcewise and Pairwise Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Pairwise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and localized distributed data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-stretch spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral sparsification via random spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Stretch Pairwise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles beyond the Thorup--Zwick Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners and emulators with sublinear distance errors / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:43, 8 July 2024

scientific article; zbMATH DE number 6312346
Language Label Description Also known as
English
Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
scientific article; zbMATH DE number 6312346

    Statements

    Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (English)
    0 references
    1 July 2014
    0 references
    spanner
    0 references
    metric embedding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers