On Making Directed Graphs Transitive
From MaRDI portal
Publication:3183483
DOI10.1007/978-3-642-03367-4_47zbMath1253.68267MaRDI QIDQ3183483
Rolf Niedermeier, Christian Komusiewicz, Mathias Weller, 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
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter algorithms for cluster vertex deletion
- A more effective linear kernelization for cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- Efficient determination of the transitive closure of a directed graph
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- On the complexity of bicoloring clique hypergraphs of graphs
- Efficient Parameterized Preprocessing for Cluster Editing