On Making Directed Graphs Transitive

DOI10.1007/978-3-642-03367-4_47MaRDI QIDQ3183483zbMATH OpenOpenAlexFDO

Authors Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, 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

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

Recommendations

• On making directed graphs transitive
• scientific article; zbMATH DE number 15035
• scientific article; zbMATH DE number 4200238
• scientific article; zbMATH DE number 4156472
• Inferring (biological) signal transduction networks via transitive reductions of directed graphs

Cites work

• 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
• Efficient Parameterized Preprocessing for Cluster Editing
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Fixed-parameter algorithms for cluster vertex deletion
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• On the complexity of bicoloring clique hypergraphs of graphs

Cited in

(5)

• Efficient algorithms for Eulerian extension
• Approximating Transitive Reductions for Directed Networks
• scientific article; zbMATH DE number 15035 (Why is no real title available?)
• On making directed graphs transitive
• Inferring (biological) signal transduction networks via transitive reductions of directed graphs

This page was built for publication: On Making Directed Graphs Transitive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183483)