Efficient enumeration of all minimal separators in a graph (Q1390866)
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: Efficient enumeration of all minimal separators in a graph |
scientific article; zbMATH DE number 1177594
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of all minimal separators in a graph |
scientific article; zbMATH DE number 1177594 |
Statements
Efficient enumeration of all minimal separators in a graph (English)
0 references
22 July 1998
0 references
minimal separators
0 references
0 references
0.9174275
0 references
0.91432154
0 references
0.91432154
0 references
0.9116123
0 references
0.91052365
0 references
0.89997244
0 references
