A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987796300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / 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: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / 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 Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Compression for Exactly Solving NP-Hard Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / 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: Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / 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: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 11:02, 9 July 2024

scientific article
Language Label Description Also known as
English
A fixed-parameter algorithm for the vertex cover \(P_3\) problem
scientific article

    Statements

    A fixed-parameter algorithm for the vertex cover \(P_3\) problem (English)
    0 references
    9 December 2014
    0 references
    fixed-parameter algorithm
    0 references
    vertex cover \(P_3\) problem
    0 references
    iterative compression
    0 references
    0 references

    Identifiers