Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.tcs.2016.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2555985695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding small degree-constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-constrained decompositions of graphs: Bounded treewidth and planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for decomposing graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs with girth at least five under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / 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: Efficient edge domination problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of triangle-free graphs under degree constraints / 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: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating induced matching based on graph partition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:44, 13 July 2024

scientific article
Language Label Description Also known as
English
Complexity and kernels for bipartition into degree-bounded induced graphs
scientific article

    Statements

    Complexity and kernels for bipartition into degree-bounded induced graphs (English)
    0 references
    0 references
    0 references
    23 December 2016
    0 references
    graph algorithms
    0 references
    bipartition
    0 references
    kernelization
    0 references
    NP-hard
    0 references
    fixed-parameter tractable
    0 references

    Identifiers

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