Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2014.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W3004503647
@@ Property / OpenAlex ID: W3004503647 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
+Normal rank
@@ Property / cites work @@
+Tree decompositions of graphs: saving memory in dynamic programming
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+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 @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Strong lower bounds on the approximability of some NPO PB-complete maximization problems
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Maximum regular induced subgraphs in \(2P_3\)-free graphs
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improving an upper bound on the size of \(k\)-regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Approximability results for the maximum and minimum maximal induced matching problems
+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