The Minimum Moving Spanning Tree Problem

DOI10.7155/JGAA.00607MaRDI QIDQ5886031zbMATH OpenOpenAlexFDO

Authors Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid

Publication date 30 March 2023

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00607

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On minimum and maximum spanning trees of linearly moving points
• Minimum Spanning Tree with Neighborhoods
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic Euclidean minimum spanning tree in the plane
• Transitions in geometric minimum spanning trees

Cites work

• scientific article; zbMATH DE number 4022030 (Why is no real title available?)
• scientific article; zbMATH DE number 3717343 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Colored spanning graphs for set visualization
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Finding the shortest bottleneck edge in a parametric minimum spanning tree
• Geometric Spanner Networks
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic pie Delaunay graph and its applications
• On minimum and maximum spanning trees of linearly moving points
• Some dynamic computational geometry problems
• The Min-Max Spanning Tree Problem and some extensions
• The minimum moving spanning tree problem
• Transitions in geometric minimum spanning trees

Cited in

(4)

• Kinetic Euclidean minimum spanning tree in the plane
• Computing the minimum bottleneck moving spanning tree
• On minimum and maximum spanning trees of linearly moving points
• The Minimum Spanning Tree Problem with Time Window Constraints

This page was built for publication: The Minimum Moving Spanning Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886031)