On making directed graphs transitive (Q414917): Difference between revisions

@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Golden Ratio Parameterized Algorithm for Cluster Editing
+Normal rank
@@ Property / cites work @@
+Exact algorithms for cluster editing: Evaluation and experiments
+Normal rank
@@ Property / cites work @@
+Even faster parameterized cluster deletion and cluster editing
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+A \(2k\) kernel for the cluster editing problem
@@ Property / cites work: A \(2k\) kernel for the cluster editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Parameterized Preprocessing for Cluster Editing
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Automated generation of search tree algorithms for hard graphs modification problems
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Alternative Parameterizations for Cluster Editing
@@ Property / cites work: Alternative Parameterizations for Cluster Editing / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hard problems in hierarchical-tree clustering
@@ Property / cites work: NP-hard problems in hierarchical-tree clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient determination of the transitive closure of a directed graph
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A general method to speed up fixed-parameter-tractable algorithms
+Normal rank
@@ Property / cites work @@
+Applying modular decomposition to parameterized cluster editing problems
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank