On Making Directed Graphs Transitive (Q3183483): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03367-4_47
+Normal rank
@@ Property / OpenAlex ID @@
+W2122542016
@@ Property / OpenAlex ID: W2122542016 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4539516
@@ Property / cites work: Q4539516 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Cluster Editing: Evaluation and Experiments
+Normal rank
@@ Property / cites work @@
+Efficient Parameterized Preprocessing for Cluster Editing
+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 @@
+On the complexity of bicoloring clique hypergraphs of graphs
+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 @@
+Applying modular decomposition to parameterized cluster editing problems
+Normal rank