Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs (Q4004839)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs |
scientific article |
Statements
Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs (English)
0 references
27 September 1992
0 references
delta-to-star reduction
0 references
series-parallel graph
0 references
polynomial-time enumeration algorithm
0 references
minimal cutsets
0 references
undirected planar graphs
0 references
