Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2015.11.003 / 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.disopt.2015.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2218434618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / 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 factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / 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: On the vertex \(k\)-path cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / 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: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2015.11.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:14, 11 December 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter algorithms for Vertex Cover \(P_3\)
scientific article

    Statements

    Fixed-parameter algorithms for Vertex Cover \(P_3\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    Vertex Cover \(P_3\)
    0 references
    bounded-degree-1 set
    0 references
    fixed-parameter algorithm
    0 references
    branch and reduce
    0 references

    Identifiers