Parameterized complexity of three edge contraction problems with degree constraints (Q471188): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-014-0204-z / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003852880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Amount of Nondeterminism and the Power of Verifying / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of parameterized problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting Few Edges to Remove Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-based methods in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / 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: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining planarity by contracting few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the minimum degree of a graph by contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster FPT algorithm for bipartite contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting chordal graphs and bipartite graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a Bipartite Graph by Contracting Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing cut sets in a graph by the number of their components / 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: On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of editing graphs for bounded degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00236-014-0204-Z / rank
 
Normal rank

Latest revision as of 18:27, 9 December 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of three edge contraction problems with degree constraints
scientific article

    Statements

    Parameterized complexity of three edge contraction problems with degree constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers