Finding coherent cyclic orders in strong digraphs (Q949783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheels within wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax relations for cyclically ordered digraphs / rank
 
Normal rank

Latest revision as of 18:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Finding coherent cyclic orders in strong digraphs
scientific article

    Statements

    Finding coherent cyclic orders in strong digraphs (English)
    0 references
    0 references
    0 references
    21 October 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    cyclic order
    0 references
    coherent cyclic order
    0 references
    0 references