The minimum moving spanning tree problem (Q832829): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Kinetic Pie Delaunay Graph and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some dynamic computational geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colored spanning graphs for set visualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for algorithm stability and its application to kinetic Euclidean MSTs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kinetic Euclidean minimum spanning tree in the plane / rank
 
Normal rank

Latest revision as of 11:04, 28 July 2024

scientific article
Language Label Description Also known as
English
The minimum moving spanning tree problem
scientific article

    Statements

    Identifiers