Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4459826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling and colorful independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LBFS Structure and Recognition of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / 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: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip Graphs: Recognition and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Well Can Graphs Represent Wireless Interference? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Sequencing and Scheduling in Coil Coating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance intersection graphs on binary trees with constant tolerance 3 / 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: Recognizing \(d\)-interval graphs and \(d\)-track interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Graphs of Helly Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing weighted number of just-in-time jobs on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs with fixed interval number is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination graphs / rank
 
Normal rank

Revision as of 14:30, 20 July 2024

scientific article
Language Label Description Also known as
English
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
scientific article

    Statements

    Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2019
    0 references
    independent set
    0 references
    job interval selection
    0 references
    interval graphs
    0 references
    chordal graphs
    0 references
    inductive \(k\)-independent graphs
    0 references
    NP-hard problems
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references