Experimental studies of graph traversal algorithms

DOI10.1007/3-540-44867-5_10MaRDI QIDQ4426350zbMATH OpenFDO

Authors Rudolf Fleischer, Gerhard Trippen

Publication date 16 September 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/2647/26470120.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1858605
• Implementations and experimental studies of dynamic graph algorithms
• Algorithmic aspects in speech recognition
• Algorithms and experiments for parameterized approaches to hard graph problems
• scientific article; zbMATH DE number 1984242
• scientific article; zbMATH DE number 871915
• scientific article; zbMATH DE number 3920516
• Algorithms and Experiments for the Webgraph

Cited in

(3)

• Online graph exploration: New results on old and new algorithms
• Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
• Lower and upper competitive bounds for online directed graph exploration

This page was built for publication: Experimental studies of graph traversal algorithms

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