On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732)

From MaRDI portal
Revision as of 00:41, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57568032, #quickstatements; #temporary_batch_1711055989931)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On matrices with the Edmonds-Johnson property arising from bidirected graphs
scientific article

    Statements

    On matrices with the Edmonds-Johnson property arising from bidirected graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    combinatorial optimization
    0 references
    strong Chvàtal rank
    0 references
    Edmonds-Johnson property
    0 references
    excluded minors
    0 references
    bidirected graphs
    0 references
    0 references
    0 references