๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Deriving a class of layer-oriented graph algorithms

โœ Scribed by Martin Russling

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
997 KB
Volume
26
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Orderly algorithms for generating restri
Orderly algorithms for generating restricted classes of graphs
โœ Charles J. Colbourn; Ronald C. Read ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of

Deriving a Graph Rewriting System from a
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
โœ Rom Langerak ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 989 KB

The starting point of this paper is McMillan's complete nite pre x of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly in nite) system behaviour from the complete nite pre x. An algorithm is presente