On the parameterized vertex cover problem for graphs with perfect matching (Q893740): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022122931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved fixed-parameter algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating minimum vertex cover for graphs with perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing MAX SNP Problems Above Guaranteed Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph characterization of red/blue-split graph and kőnig egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: König Deletion Sets and Vertex Covers above the Matching Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Flowers and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904774 / rank
 
Normal rank

Latest revision as of 03:22, 11 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized vertex cover problem for graphs with perfect matching
scientific article

    Statements

    On the parameterized vertex cover problem for graphs with perfect matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 November 2015
    0 references
    NP-complete
    0 references
    parameterized algorithm
    0 references
    vertex cover
    0 references
    iterative compression
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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