Maintaining dynamic minimum spanning trees: An experimental study

DOI10.1007/3-540-45643-0_9MaRDI QIDQ4707794zbMATH OpenFDO

Authors Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro-Petrillo, Giuseppe F. Italiano

Publication date 11 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2409/24090111.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• Maintaining dynamic minimum spanning trees: an experimental study
• Maintaining minimum spanning trees in dynamic graphs
• scientific article; zbMATH DE number 871915
• Maintaining minimum spanning forests in dynamic graphs
• Maintenance of a minimum spanning forest in a dynamic plane graph

Cited in

(10)

• Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
• Maintaining Nets and Net Trees under Incremental Motion
• Implementations and experimental studies of dynamic graph algorithms
• Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
• scientific article; zbMATH DE number 871915 (Why is no real title available?)
• Algorithmic aspects in speech recognition
• Maximum core spanning tree maintenance for large dynamic graphs
• Recent advances in fully dynamic graph algorithms (invited talk)
• Maximum core spanning tree insertion maintenance for large dynamic graphs
• Maintaining dynamic minimum spanning trees: an experimental study

This page was built for publication: Maintaining dynamic minimum spanning trees: An experimental study

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