Chordal deletion is fixed-parameter tractable (Q973007): 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/s00453-008-9233-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1964064059
@@ Property / OpenAlex ID: W1964064059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579375
@@ Property / cites work: Q3579375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
+Normal rank
@@ Property / cites work @@
+Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+Q3549635
@@ Property / cites work: Q3549635 / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Detecting a Network Failure
@@ Property / cites work: Detecting a Network Failure / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Wheel-Free Deletion Is W[2]-Hard
@@ Property / cites work: Wheel-Free Deletion Is W[2]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized coloring problems on chordal graphs
@@ Property / cites work: Parameterized coloring problems on chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a Planar Graph by Vertex Deletion
@@ Property / cites work: Obtaining a Planar Graph by Vertex Deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank