Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions

DOI10.1007/11940128_43zbMath1135.05305OpenAlexW1556070262MaRDI QIDQ5459137

Pinar Heggernes, Federico Mancini, Charis Papadopoulos

Publication date: 24 April 2008

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

Full work available at URL: https://doi.org/10.1007/11940128_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Characterizing and Computing Minimal Cograph Completions ⋮ Minimal proper interval completions ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Dynamically maintaining split graphs

This page was built for publication: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions