On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.tcs.2011.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034112762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard graph problems and boundary classes of graphs / 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: Independent packings in structured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative compression and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fine-grained Analysis of a Simple Independent Set Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / 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: The complexity of dissociation set problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 4 July 2024

scientific article
Language Label Description Also known as
English
On computing the minimum 3-path vertex cover and dissociation number of graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references