Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963995309 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.07022 / 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: An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex \(k\)-path cover / 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: Kernels for Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized perspective on packing paths of length two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum path cover of a distance-hereditary graph in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster FPT algorithm for 3-path vertex cover / 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: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Algorithm for Bounded-Degree Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for Vertex Cover \(P_3\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 13 July 2024

scientific article
Language Label Description Also known as
English
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
scientific article

    Statements

    Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (English)
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references