Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
DOI10.1007/S10288-005-0079-5zbMATH Open1107.05033OpenAlexW1997985693MaRDI QIDQ862816FDOQ862816
Authors: Frédéric Gardi 
Publication date: 24 January 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0079-5
Recommendations
- Mutual exclusion scheduling with interval graphs or related classes. I
- Mutual exclusion scheduling with interval graphs or related classes. II
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Mutual exclusion scheduling
- Scheduling with undirected graphs: motivations and reviews
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Cited In (8)
- Mutual exclusion scheduling with interval graphs or related classes. I
- Robust maximum weighted independent-set problems on interval graphs
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Mutual exclusion scheduling with interval graphs or related classes. II
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- Title not available (Why is that?)
- On partitioning interval graphs into proper interval subgraphs and related problems
This page was built for publication: Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862816)
