The polynomial dichotomy for three nonempty part sandwich problems (Q5900084): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homogeneous set sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: List Partitions / 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: Q4508373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich problem for cutsets: clique cutset, \(k\)-star cutset / rank
 
Normal rank

Latest revision as of 11:22, 28 June 2024

scientific article; zbMATH DE number 5284979
Language Label Description Also known as
English
The polynomial dichotomy for three nonempty part sandwich problems
scientific article; zbMATH DE number 5284979

    Statements

    The polynomial dichotomy for three nonempty part sandwich problems (English)
    0 references
    5 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    computational complexity
    0 references
    structural characterization of graphs
    0 references
    0 references