Generating sparse 2—spanners (Q5056130): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guy Kortsarz / rank
 
Normal rank
Property / author
 
Property / author: David Peleg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-55706-7_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1631963815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-diameter graph decomposition is in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast network decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating sparse spanners for weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay graphs are almost as good as complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid spanners / 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

Latest revision as of 02:06, 31 July 2024

scientific article; zbMATH DE number 7631647
Language Label Description Also known as
English
Generating sparse 2—spanners
scientific article; zbMATH DE number 7631647

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references