The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2014.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2786954219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the List Partition Problem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(2K_{2}\) vertex-set partition into nonempty parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(2K_2\)-partition of some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P versus NP-complete dichotomy of some challenging problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Large Clique Minors is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs with few complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Computing vertex-surjective homomorphisms to partially reflexive trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting 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: On the complexity of H-coloring / 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: On disconnected cuts and separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Skew Partition Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The external constraint 4 nonempty part sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into connected parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction, Retraction, and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Partition of Some Class of Graphs under Compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for partition of some class of graphs under compaction and vertex-compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding clique cut-sets / rank
 
Normal rank

Latest revision as of 19:39, 9 July 2024

scientific article
Language Label Description Also known as
English
The computational complexity of disconnected cut and \(2 K_2\)-partition
scientific article

    Statements

    The computational complexity of disconnected cut and \(2 K_2\)-partition (English)
    0 references
    0 references
    0 references
    5 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    disconnected cut
    0 references
    \(2K_2\)-partition
    0 references
    biclique cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references