Finding all minimum-size separating vertex sets in a graph (Q3141110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 444633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding all minimum-size separating vertex sets in a graph |
scientific article; zbMATH DE number 444633 |
Statements
Finding all minimum-size separating vertex sets in a graph (English)
0 references
12 December 1993
0 references
minimum-size vertex sets
0 references
minimum-size edge cut sets
0 references
parallel version
0 references
0.8139148354530334
0 references
