EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597): Difference between revisions
From MaRDI portal
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: Efficient construction of a bounded-degree spanner with low weight / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Algorithm for Constructing Sparse Euclidean Spanners / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees / rank | |||
Normal rank | |||
Latest revision as of 11:57, 7 June 2024
scientific article; zbMATH DE number 2104296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER |
scientific article; zbMATH DE number 2104296 |
Statements
EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (English)
0 references
29 September 2004
0 references
spanner
0 references
bounded degree
0 references
low weight
0 references
planar
0 references
localized algorithm
0 references
