On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-016-9999-6 / rank
Normal rank
 
Property / author
 
Property / author: Jian-hua Tu / rank
Normal rank
 
Property / author
 
Property / author: Jian-hua Tu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ComputeTW / 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.1007/s10878-016-9999-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2472778302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: On the weighted \(k\)-path vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / 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: On computing the minimum 3-path vertex cover and dissociation number of 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: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Graph minors. II. Algorithmic aspects of tree-width / 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: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / 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 / DOI
 
Property / DOI: 10.1007/S10878-016-9999-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:28, 28 December 2024

scientific article
Language Label Description Also known as
English
On the vertex cover \(P_3\) problem parameterized by treewidth
scientific article

    Statements

    On the vertex cover \(P_3\) problem parameterized by treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    graph algorithms
    0 references
    parameterized complexity
    0 references
    vertex cover \(P_3\) problem
    0 references
    tree decomposition
    0 references
    treewidth
    0 references
    0 references
    0 references

    Identifiers