Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs

DOI10.1007/978-3-540-69507-3_21zbMath1131.68485OpenAlexW1571815623MaRDI QIDQ5448777

Miroslaw Dynia, Miroslaw Korzeniowski, Jarosław Kutyłowski

Publication date: 7 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Randomized algorithms (68W20)

Related Items (1)

The Power of Recourse for Online MST and TSP

This page was built for publication: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs