On the approximability of the maximum induced matching problem (Q1775017): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2004.05.001
@@ Property / DOI: 10.1016/j.jda.2004.05.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and stability number of chair-, co-P- and gem-free graphs revisited
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in intersection graphs.
@@ Property / cites work: Induced matchings in intersection graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum induced matching in weakly chordal graphs
+Normal rank
@@ Property / cites work @@
+Induced matchings in asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
+Normal rank
@@ Property / cites work @@
+Q3139292
@@ Property / cites work: Q3139292 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Irredundancy in circular arc graphs
@@ Property / cites work: Irredundancy in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite Domination and Simultaneous Matroid Covers
+Normal rank
@@ Property / cites work @@
+Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
+Normal rank
@@ Property / cites work @@
+Some results on graphs without long induced paths
@@ Property / cites work: Some results on graphs without long induced paths / rank @@
+Normal rank
@@ Property / cites work @@
+On maximum induced matchings in bipartite graphs
@@ Property / cites work: On maximum induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index ofC4-free graphs
@@ Property / cites work: The strong chromatic index ofC4-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of strong edge coloring
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2004.05.001
@@ Property / DOI: 10.1016/J.JDA.2004.05.001 / rank @@
+Normal rank