scientific article; zbMATH DE number 4086991

MaRDI QIDQ3815518zbMATH OpenFDO

Authors Rudolf Berghammer, Herbert Ehler, Hans Zierer

Publication date 1988

zbMATH Keywords

CIPdirected graphsprogram transformationsreachability algorithms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1407672
• scientific article; zbMATH DE number 3936509
• scientific article; zbMATH DE number 3874635
• Graphs and algorithms
• Formal derivation of graph algorithmic programs using partition-and-recur

Cited in

(6)

• The Munich project CIP. Volume II: The program transformation system CIP- S
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
• scientific article; zbMATH DE number 3936509 (Why is no real title available?)
• Spanners and Reachability Oracles for Directed Transmission Graphs

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 Q3815518)