Lattices of processes for graphs
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part IX, Tome 202 (1992), pp. 135-153
Cet article a éte moissonné depuis la source Math-Net.Ru
The structure of the lattice of processes of a finite digraph with entries is investigated. Necessary and sufficient conditions for the isomorphism of a given lattice to the lattice of processes of a certain digraph are obtained. Bibliography: 5 titles.
@article{ZNSL_1992_202_a7,
author = {K. V. Shakhbazyan and N. B. Lebedinskaya},
title = {Lattices of processes for graphs},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {135--153},
year = {1992},
volume = {202},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1992_202_a7/}
}
K. V. Shakhbazyan; N. B. Lebedinskaya. Lattices of processes for graphs. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part IX, Tome 202 (1992), pp. 135-153. http://geodesic.mathdoc.fr/item/ZNSL_1992_202_a7/