Generating cut conjunctions in graphs and related problems (Q930604)

From MaRDI portal
Revision as of 15:50, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/KhachiyanBBEGM08, #quickstatements; #temporary_batch_1731508824982)





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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2008
    0 references
    Cut conjunction
    0 references
    Cut generation
    0 references
    Graph
    0 references
    Matroid
    0 references
    Multicut
    0 references

    Identifiers