Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2011.12.001 / 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.jctb.2011.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997576329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / 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: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / 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: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXII. Irrelevant vertices in linkage problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2011.12.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:47, 9 December 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
scientific article

    Statements

    Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (English)
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    feedback vertex set
    0 references
    cycle packing
    0 references
    FPT algorithm
    0 references
    graph minor
    0 references

    Identifiers

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