Computing the greedy spanner in linear space (Q893321): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59427635, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distribution-Sensitive Construction of the Greedy Spanner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the greedy spanner in near-quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Computing the Greedy Spanner / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental study of geometric <i>t</i> -spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank

Latest revision as of 03:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Computing the greedy spanner in linear space
scientific article

    Statements

    Computing the greedy spanner in linear space (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    0 references
    geometric spanner
    0 references
    dilation
    0 references
    stretch factor
    0 references
    greedy algorithm
    0 references
    computational geometry
    0 references
    0 references
    0 references