Augmenting approach for some maximum set problems (Q284765): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.03.009 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6581803 / rank
 
Normal rank
Property / zbMATH Keywords
 
node-deletion problem
Property / zbMATH Keywords: node-deletion problem / rank
 
Normal rank
Property / zbMATH Keywords
 
independent set
Property / zbMATH Keywords: independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
dissociative set
Property / zbMATH Keywords: dissociative set / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex \(k\)-path cover
Property / zbMATH Keywords: vertex \(k\)-path cover / rank
 
Normal rank
Property / zbMATH Keywords
 
feedback vertex cover
Property / zbMATH Keywords: feedback vertex cover / rank
 
Normal rank
Property / zbMATH Keywords
 
induced matching
Property / zbMATH Keywords: induced matching / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-regular induced subgraph
Property / zbMATH Keywords: \(k\)-regular induced subgraph / rank
 
Normal rank
Property / zbMATH Keywords
 
augmenting graph
Property / zbMATH Keywords: augmenting graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.03.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2342695705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets for (P_{6}, K_{2,3})-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2016.03.009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:17, 9 December 2024

scientific article
Language Label Description Also known as
English
Augmenting approach for some maximum set problems
scientific article

    Statements

    Augmenting approach for some maximum set problems (English)
    0 references
    0 references
    18 May 2016
    0 references
    node-deletion problem
    0 references
    independent set
    0 references
    dissociative set
    0 references
    vertex \(k\)-path cover
    0 references
    feedback vertex cover
    0 references
    induced matching
    0 references
    \(k\)-regular induced subgraph
    0 references
    augmenting graph
    0 references

    Identifiers