Minimal cuts in two-terminal directed acyclic graphs (Q3615909)
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: Minimal cuts in two-terminal directed acyclic graphs |
scientific article; zbMATH DE number 5532089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal cuts in two-terminal directed acyclic graphs |
scientific article; zbMATH DE number 5532089 |
Statements
24 March 2009
0 references
minimal cut
0 references
series-parallel graph
0 references
two-terminal directed acyclic graph
0 references
reduction
0 references
0.8500661253929138
0 references
0.7975211143493652
0 references
0.7964792847633362
0 references
0.7717069983482361
0 references
