\input zb-basic
\input zb-ioport
\iteman{io-port 05234258}
\itemau{\c T\u and\u areanu, Nicolae}
\itemti{A recursive method to compute the layers of a stratified graph.}
\itemso{J. Mult.-Val. Log. Soft Comput. 12, No. 3-4, 355-363 (2006).}
\itemab
In several works the author has introduced and studied labelled stratified graphs, or stratified graphs or SLGs for short, which have applications to hypertext representation, studies of some problems in VLSI, and knowledge representation. An SLG is a structure associated with a labelled graph, whose definition is too technical to be reproduced here and which involves a universal-algebra machinery including Peano algebras. The construction of an SLG amounts to the determination of a family of sets called layers, for which a new algorithm is given in this paper.  Reviewer's remark. Formula (6) on page 359 is in fact valid for all $\rho\in T$.
\itemrv{Sergiu Rudeanu (Bucure\c{s}ti)}
\itemcc{}
\itemut{stratified graph; layer; Peano algebra}
\itemli{}
\end