A note on the recognition of nested graphs

Mark Korenblit; Vadim E. Levit

doi:10.1007/978-3-642-02029-2_4

A note on the recognition of nested graphs

Mark Korenblit, Vadim E. Levit

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday
Editors	Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell
Pages	36-40
Number of pages	5
DOIs	https://doi.org/10.1007/978-3-642-02029-2_4
State	Published - 2009

Publication series

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

Access to Document

10.1007/978-3-642-02029-2_4

Cite this

Korenblit, M., & Levit, V. E. (2009). A note on the recognition of nested graphs. In M. Lipshteyn, V. E. Levit, & R. M. McConnell (Eds.), Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (pp. 36-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5420 LNCS). https://doi.org/10.1007/978-3-642-02029-2_4

Korenblit, Mark ; Levit, Vadim E. / A note on the recognition of nested graphs. Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. editor / Marina Lipshteyn ; Vadim E. Levit ; Ross M. McConnell. 2009. pp. 36-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{542cc2d2e6c14652bef0baefe1b1de1d,

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",

}

Korenblit, M & Levit, VE 2009, A note on the recognition of nested graphs. in M Lipshteyn, VE Levit & RM McConnell (eds), Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5420 LNCS, pp. 36-40. https://doi.org/10.1007/978-3-642-02029-2_4

A note on the recognition of nested graphs. / Korenblit, Mark; Levit, Vadim E.
Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. ed. / Marina Lipshteyn; Vadim E. Levit; Ross M. McConnell. 2009. p. 36-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5420 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A note on the recognition of nested graphs

AU - Korenblit, Mark

AU - Levit, Vadim E.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70249133348&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02029-2_4

DO - 10.1007/978-3-642-02029-2_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70249133348

SN - 3642020283

SN - 9783642020285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 36

EP - 40

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

A2 - Lipshteyn, Marina

A2 - Levit, Vadim E.

A2 - McConnell, Ross M.

ER -

Korenblit M, Levit VE. A note on the recognition of nested graphs. In Lipshteyn M, Levit VE, McConnell RM, editors, Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. 2009. p. 36-40. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-02029-2_4

A note on the recognition of nested graphs

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this