Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.03.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248887642 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59699139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Note on the Branch-and-Bound Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs and Ramseyian Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on a Problem of Moser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Extreme Points / rank
 
Normal rank

Latest revision as of 17:43, 24 June 2024

scientific article
Language Label Description Also known as
English
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references