Implementations and experimental studies of dynamic graph algorithms

DOI10.1007/3-540-36383-1_11MaRDI QIDQ4417681zbMATH OpenFDO

Authors Christos Zaroliagis

Publication date 29 July 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/2547/25470229.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

• scientific article; zbMATH DE number 871915
• Maintaining dynamic minimum spanning trees: An experimental study
• Algorithmic aspects in speech recognition
• Maintaining dynamic minimum spanning trees: an experimental study
• An experimental study of algorithms for fully dynamic transitive closure

Cited in

(7)

• Recognizing union-find trees is NP-complete
• Single backup table schemes for shortest-path routing
• Experimental studies of graph traversal algorithms
• The State of the Art in Dynamic Graph Algorithms
• Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
• Dynamic graphs, end-to-end: containers, frameworks, and benchmarks
• Recent advances in fully dynamic graph algorithms (invited talk)

Describes a project that uses

Uses Software

• Balibase

This page was built for publication: Implementations and experimental studies of dynamic graph algorithms

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