The external constraint 4 nonempty part sandwich problem (Q531610): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.03.015 / rank
Normal rank
 
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.dam.2010.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032417107 / 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: The homogeneous set sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect 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: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decision and optimization (\(k\),\(l\))-graph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable skew partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended skew partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph sandwich problem for 1-join composition is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix partitions of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: List matrix partitions of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for graph and hypergraph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded degree interval sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Skew Partition Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial dichotomy for three nonempty part sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew partition sandwich problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich problem for cutsets: clique cutset, \(k\)-star cutset / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.03.015 / rank
 
Normal rank

Latest revision as of 20:36, 9 December 2024

scientific article
Language Label Description Also known as
English
The external constraint 4 nonempty part sandwich problem
scientific article

    Statements

    The external constraint 4 nonempty part sandwich problem (English)
    0 references
    19 April 2011
    0 references
    graph sandwich problems
    0 references
    list partitions
    0 references
    computational complexity
    0 references
    combinatorial algorithms
    0 references
    applied combinatorics
    0 references

    Identifiers