Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W2139428469 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.0187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems in multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of short computation and factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recovering syntenic blocks from comparative maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating set is fixed parameter tractable in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / 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: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of irredundant sets parameterized by size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reduction and exact algorithms for clique cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values of the interval number of a graph, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of some optimization problems related to multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity in Multiple-Interval Graphs: Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs / rank
 
Normal rank

Latest revision as of 22:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
scientific article

    Statements

    Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (English)
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    parameterized complexity
    0 references
    multiple-interval graphs
    0 references
    domination
    0 references
    \(k\)-dominating set
    0 references
    \(d\)-distance \(k\)-dominating set
    0 references
    hardness
    0 references
    completeness
    0 references
    partition
    0 references
    separation
    0 references
    separating vertices
    0 references
    irredundant set
    0 references

    Identifiers