Maintaining Nets and Net Trees under Incremental Motion

DOI10.1007/978-3-642-10631-6_114MaRDI QIDQ3652299zbMATH OpenOpenAlexFDO

Authors Minkyoung Cho, David M. Mount, Eunhui Park

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_114

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Maintaining minimum spanning trees in dynamic graphs
• Incremental network design with minimum spanning trees
• Maintaining minimum spanning forests in dynamic graphs
• Fully dynamic arboricity maintenance
• Fully dynamic arboricity maintenance
• Maintenance of a minimum spanning forest in a dynamic plane graph
• scientific article; zbMATH DE number 1926664
• Maintaining dynamic minimum spanning trees: an experimental study
• Constrained dynamic tree networks

Cited in

(2)

• Minimizing co-location potential of moving entities
• A computational framework for incremental motion

This page was built for publication: Maintaining Nets and Net Trees under Incremental Motion

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