scientific article; zbMATH DE number 3874635

MaRDI QIDQ3340175zbMATH OpenFDO

Authors William L. Scherlis, J. Reif

Publication date 1984

zbMATH Keywords

algorithm derivationdepth-first-searchefficient algorithmsgraph algorithmshigh-level principles of program derivationprogram transformation

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

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

Cited in

(6)

• 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 3936509 (Why is no real title available?)
• scientific article; zbMATH DE number 4086991 (Why is no real title available?)
• Deriving efficient graph algorithms

This page was built for publication:

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