On Making Directed Graphs Transitive

DOI10.1007/978-3-642-03367-4_47zbMath1253.68267MaRDI QIDQ3183483

Rolf Niedermeier, Mathias Weller, Christian Komusiewicz, Johannes Uhlmann

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_47

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments