Generating cut conjunctions in graphs and related problems (Q930604)
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: Generating cut conjunctions in graphs and related problems |
scientific article; zbMATH DE number 5294786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating cut conjunctions in graphs and related problems |
scientific article; zbMATH DE number 5294786 |
Statements
Generating cut conjunctions in graphs and related problems (English)
0 references
1 July 2008
0 references
Cut conjunction
0 references
Cut generation
0 references
Graph
0 references
Matroid
0 references
Multicut
0 references
0 references
0.9561006426811218
0 references
0.8161402344703674
0 references
0.786260724067688
0 references
0.7781074047088623
0 references
