Algorithms on subtree filament graphs
F Gavril - Graph Theory, Computational Intelligence and Thought …, 2009 - Springer
Algorithms on Subtree Filament Graphs Page 1 M. Lipshteyn et al. (Eds.): Golumbic Festschrift,
LNCS 5420, pp. 27–35, 2009. © Springer-Verlag Berlin Heidelberg 2009 Algorithms on …
LNCS 5420, pp. 27–35, 2009. © Springer-Verlag Berlin Heidelberg 2009 Algorithms on …
A Note on the Recognition of Nested Graphs
M Korenblit, VE Levit - … Intelligence and Thought: Essays Dedicated to …, 2009 - Springer
We consider a two-terminal directed acyclic graph (st-dag) characterized by a special
structure of its mincuts and call it a nested graph. This graph is of interest as an st-dag with a …
structure of its mincuts and call it a nested graph. This graph is of interest as an st-dag with a …