@inproceedings{7ef1f475b4db4adab956c043832412a2,

title = "A note on the recognition of nested graphs",

abstract = "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 minimum possible number of mincuts.We present a linear-time algorithm for recognizing nested graphs.",

author = "Mark Korenblit and Levit, {Vadim E.}",

year = "2009",

doi = "10.1007/978-3-642-02029-2_4",

language = "אנגלית",

isbn = "3642020283",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "36--40",

editor = "Marina Lipshteyn and Levit, {Vadim E.} and McConnell, {Ross M.}",

booktitle = "Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday",

}