Editing graphs to satisfy degree constraints: a parameterized approach (Q414866): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6033487
@@ Property / zbMATH DE Number: 6033487 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph editing
@@ Property / zbMATH Keywords: graph editing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+regular subgraph
@@ Property / zbMATH Keywords: regular subgraph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+general factor
@@ Property / zbMATH Keywords: general factor / rank @@
+Normal rank
@@ 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.1016/j.jcss.2011.02.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2081215656
@@ Property / OpenAlex ID: W2081215656 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels: Annotated, Proper and Induced
@@ Property / cites work: Kernels: Annotated, Proper and Induced / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic proof of Tutte's f-factor theorem
@@ Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a \(\Delta\)-regular supergraph of minimum order
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum \(k\)-regular induced subgraphs
@@ Property / cites work: Maximum \(k\)-regular induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of regular subgraph recognition
@@ Property / cites work: The complexity of regular subgraph recognition / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Three‐regular subgraphs of four‐regular graphs
+Normal rank
@@ Property / cites work @@
+General factors of graphs
@@ Property / cites work: General factors of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+The factorization of graphs. II
@@ Property / cites work: The factorization of graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Antifactors of graphs
@@ Property / cites work: Antifactors of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Graph Editing with Chosen Vertex Degrees
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+A note on the complexity of finding regular subgraphs
+Normal rank
@@ Property / cites work @@
+General antifactors of graphs
@@ Property / cites work: General antifactors of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding whether a planar graph has a cubic subgraph is NP-complete
+Normal rank
@@ Property / cites work @@
+Finding regular subgraphs in both arbitrary and planar graphs
+Normal rank
@@ Property / cites work @@
+On locating cubic subgraphs in bounded-degree connected bipartite graphs
+Normal rank
@@ Property / cites work @@
+On the fixed-parameter tractability of parameterized model-checking problems
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+A Short Proof of the Factor Theorem for Finite Graphs
+Normal rank
@@ Property / cites work @@
+Spanning subgraphs with specified valencies
@@ Property / cites work: Spanning subgraphs with specified valencies / rank @@
+Normal rank
@@ Property / cites work @@
+Graph factors
@@ Property / cites work: Graph factors / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:414866