Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1273073
Jump to:navigation, search

DOI10.1007/BF02946498zbMath0910.68090MaRDI QIDQ1273073

Jin-Yun Xue

Publication date: 12 April 1999

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


zbMATH Keywords

graph algorithms


Mathematics Subject Classification ID

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


Related Items (3)

A Linear In-situ Algorithm for the Power of Cyclic Permutation ⋮ Algorithm design through the optimization of reuse-based generation ⋮ An algebraic approach to population-based evolutionary algorithm generation



Cites Work

  • A note on two problems in connexion with graphs
  • Calculating path algorithms
  • On a routing problem
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1273073&oldid=13367891"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki