Formal derivation of graph algorithmic programs using partition-and-recur

DOI10.1007/BF02946498MaRDI QIDQ1273073zbMATH OpenFDO

Authors Jinyun Xue

Publication date 12 April 1999

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 3874635
• Two graph algorithms derived
• Deriving efficient graph algorithms
• scientific article; zbMATH DE number 512937

Cites work

• A note on two problems in connexion with graphs
• Calculating path algorithms
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• Introduction to algorithms.
• On a routing problem

Cited in

(8)

• Two graph algorithms derived
• Algorithm design through the optimization of reuse-based generation
• An algebraic approach to population-based evolutionary algorithm generation
• scientific article; zbMATH DE number 3874635 (Why is no real title available?)
• A Linear In-situ Algorithm for the Power of Cyclic Permutation
• scientific article; zbMATH DE number 4086991 (Why is no real title available?)
• Deriving efficient graph algorithms
• Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

This page was built for publication: Formal derivation of graph algorithmic programs using partition-and-recur

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