Deriving efficient graph algorithms

DOI10.1007/B12001MaRDI QIDQ5305661zbMATH OpenOpenAlexFDO

Authors William L. Scherlis, J. Reif

Publication date 23 March 2010

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

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3874635
• Path-based depth-first search for strong and biconnected components
• Formal derivation of graph algorithmic programs using partition-and-recur
• scientific article; zbMATH DE number 3936509
• Two graph algorithms derived

Cited in

(5)

• Formal derivation of graph algorithmic programs using partition-and-recur
• Two graph algorithms derived
• Speeding up Graph Algorithms via Switching Classes
• scientific article; zbMATH DE number 3874635 (Why is no real title available?)
• scientific article; zbMATH DE number 1305093 (Why is no real title available?)

This page was built for publication: Deriving efficient graph algorithms

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