Finding coherent cyclic orders in strong digraphs

DOI10.1007/s00493-008-2305-1zbMath1164.05027OpenAlexW2068157867MaRDI QIDQ949783

Satoru Iwata, Takuro Matsuda

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2305-1

zbMATH Keywords

cyclic ordercoherent cyclic order

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Path Partitions, Cycle Covers and Integer Decomposition

Cites Work

• Minmax relations for cyclically ordered digraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Wheels within wheels
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Integer Programming and Combinatorial Optimization

This page was built for publication: Finding coherent cyclic orders in strong digraphs