Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2909443810
@@ Property / OpenAlex ID: W2909443810 / rank @@
+Normal rank
@@ Property / cites work @@
+Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
+Normal rank
@@ Property / cites work @@
+Cluster Editing
@@ Property / cites work: Cluster Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Even faster parameterized cluster deletion and cluster editing
+Normal rank
@@ Property / cites work @@
+Fast Quasi-Threshold Editing
@@ Property / cites work: Fast Quasi-Threshold Editing / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation of strong triadic closure and cluster deletion
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+Edge colorings of complete graphs without tricolored triangles
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Tight Running Time Lower Bounds for Vertex Deletion Problems
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for module map problems
@@ Property / cites work: Parameterized algorithms for module map problems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5038193