A Note on the Recognition of Nested Graphs

Authors:
Mark Korenblit;Vadim E. Levit
Affiliations:
Holon Institute of Technology, Israel;Ariel University Center of Samaria, Israel
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 6
Cited 0

Forbidden subgraphs and graph decomposition

Networks
Network reliability and algebraic structures

Network reliability and algebraic structures
Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
A new algorithm for the recognition of series parallel graphs

A new algorithm for the recognition of series parallel graphs
On algebraic expressions of series-parallel and Fibonacci graphs

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

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.