Augmenting approach for some maximum set problems (Q284765): 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.1016/j.disc.2016.03.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2342695705
@@ Property / OpenAlex ID: W2342695705 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / 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 @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145802
@@ Property / cites work: Q3145802 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691779
@@ Property / cites work: Q3691779 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+On F-independence in graphs
@@ Property / cites work: On F-independence in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4404792
@@ Property / cites work: Q4404792 / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+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 @@
+On finding augmenting graphs
@@ Property / cites work: On finding augmenting graphs / rank @@
+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 maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Stable sets for (P_{6}, K_{2,3})-free graphs
@@ Property / cites work: Stable sets for (P_{6}, K_{2,3})-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:284765