Augmenting approach for some maximum set problems
DOI10.1016/J.DISC.2016.03.009zbMATH Open1337.05083OpenAlexW2342695705MaRDI QIDQ284765FDOQ284765
Authors: Ngoc C. Lê 
Publication date: 18 May 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.03.009
Recommendations
- An augmentation algorithm for the maximum weighted stable set problem
- scientific article; zbMATH DE number 2246590
- A Linear Time Approach to the Set Maxima Problem
- On the maximum capacity augmentation algorithm for the maximum flow problem
- scientific article; zbMATH DE number 1303581
- Near-optimal solutions for the generalized max-controlled set problem
- The maximum feasible subset problem (maxFS) and applications
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- The Generalized Max-Controlled Set Problem
- Augmenting trail theorem for the maximum 1-2 matching problem
independent setinduced matching\(k\)-regular induced subgraphaugmenting graphdissociative setfeedback vertex covernode-deletion problemvertex \(k\)-path cover
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- The node-deletion problem for hereditary properties is NP-complete
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Minimum \(k\)-path vertex cover
- Maximum \(k\)-regular induced subgraphs
- Node-Deletion NP-Complete Problems
- Node-and edge-deletion NP-complete problems
- Some results on graphs without long induced paths
- On maximal independent sets of vertices in claw-free graphs
- Induced matchings
- On maximum induced matchings in bipartite graphs
- Title not available (Why is that?)
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
- TWO THEOREMS IN GRAPH THEORY
- On \({\mathcal F}\)-independence in graphs
- Title not available (Why is that?)
- Node-Deletion Problems on Bipartite Graphs
- Title not available (Why is that?)
- Stable sets for (P_{6}, K_{2,3})-free graphs
- Title not available (Why is that?)
- On finding augmenting graphs
Cited In (4)
This page was built for publication: Augmenting approach for some maximum set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284765)
