Efficient construction of a bounded-degree spanner with low weight (Q2365175): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fractional cascading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATING INTERDISTANCES IN SPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining the minimal distance of a point set in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse graph almost as good as the complete graph on points in \(k\) dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank

Latest revision as of 09:25, 27 May 2024

scientific article
Language Label Description Also known as
English
Efficient construction of a bounded-degree spanner with low weight
scientific article

    Statements

    Identifiers