A note on the recognition of nested graphs

Mark Korenblit, Vadim E. Levit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationGraph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday
EditorsMarina Lipshteyn, Vadim E. Levit, Ross M. McConnell
Number of pages5
StatePublished - 2009
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5420 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Dive into the research topics of 'A note on the recognition of nested graphs'. Together they form a unique fingerprint.

Cite this