Editing graphs to satisfy degree constraints: a parameterized approach (Q414866): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a \(\Delta\)-regular supergraph of minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of regular subgraph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three‐regular subgraphs of four‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antifactors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Graph Editing with Chosen Vertex Degrees / 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: Q5710169 / 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 note on the complexity of finding regular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General antifactors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding whether a planar graph has a cubic subgraph is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding regular subgraphs in both arbitrary and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating cubic subgraphs in bounded-degree connected bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed-parameter tractability of parameterized model-checking problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning subgraphs with specified valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors / rank
 
Normal rank

Latest revision as of 05:15, 5 July 2024

scientific article
Language Label Description Also known as
English
Editing graphs to satisfy degree constraints: a parameterized approach
scientific article

    Statements

    Editing graphs to satisfy degree constraints: a parameterized approach (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    parameterized complexity
    0 references
    computational complexity
    0 references
    kernelization
    0 references
    graph editing
    0 references
    regular subgraph
    0 references
    general factor
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references