EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiang-Yang Li / rank
Normal rank
 
Property / author
 
Property / author: Xiang-Yang Li / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195904001366 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100460487 / rank
 
Normal rank

Latest revision as of 09:49, 30 July 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