Proving Correctness of Graph Programs Relative to Recursively Nested Conditions.
Nils Erik FlickPublished in: Electron. Commun. Eur. Assoc. Softw. Sci. Technol. (2015)
Keyphrases
- provably correct
- sufficient conditions
- structured data
- directed graph
- graph theoretic
- stable set
- directed acyclic graph
- weighted graph
- graph structure
- minimum spanning tree
- computer programs
- graph model
- graph theory
- connected components
- random walk
- data structure
- database
- graph matching
- coarse to fine
- spanning tree
- undirected graph
- graph representation
- multiresolution
- dependency graph
- learning algorithm