k-cyclic Orientations of Graphs

DOI10.1007/978-3-642-17514-5_7zbMath1311.05192OpenAlexW33220931MaRDI QIDQ3060762

Yuichiro Miyamoto, Yasuaki Kobayashi, Hisao Tamaki

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_7

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On directed covering and domination problems ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments

This page was built for publication: k-cyclic Orientations of Graphs