Generating cut conjunctions in graphs and related problems (Q930604): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/algorithmica/KhachiyanBBEGM08, #quickstatements; #temporary_batch_1731508824982 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/KhachiyanBBEGM08 / rank | |||
Normal rank | |||
Revision as of 15:50, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating cut conjunctions in graphs and related problems |
scientific article |
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
