The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.02.006 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Probe threshold and probe trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probe permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of probe distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forbidden induced subgraph sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph sandwich problem for \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning cographs into cliques and stable sets / 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: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of chain probe graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning chordal graphs into independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and Linear-Time Recognition of Probe Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and recognizing probe block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Recognition of Probe Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.02.006 / rank
 
Normal rank

Latest revision as of 03:29, 11 December 2024

scientific article
Language Label Description Also known as
English
The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
scientific article

    Statements

    The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (English)
    0 references
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    probe graphs
    0 references
    partition problems
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers