Mutual exclusion scheduling with interval graphs or related classes. II
From MaRDI portal
Publication:2476265
DOI10.1016/j.dam.2007.08.017zbMath1137.05031OpenAlexW3000148867MaRDI QIDQ2476265
Publication date: 18 March 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.017
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On partitioning interval graphs into proper interval subgraphs and related problems ⋮ Bounded max-colorings of graphs ⋮ Scheduling identical jobs on uniform machines with a conflict graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
- An introduction to timetabling
- A note on the decomposition of graphs into isomorphic matchings
- Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
- Kernels in perfect line-graphs
- The ellipsoid method and its consequences in combinatorial optimization
- NP-completeness of graph decomposition problems
- Extensions of coloring models for scheduling purposes
- Claw-free graphs---a survey
- Restricted coloring models for timetabling
- Mutual exclusion scheduling
- Matching and multidimensional matching in chordal and strongly chordal graphs
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Betweenness, orders and interval graphs
- The NP-Completeness of Edge-Coloring
- How To Color Claw-Free Perfect Graphs
- Line perfect graphs
- On line perfect graphs
- Graph Classes: A Survey
- Mathematical Foundations of Computer Science 2004
- Bounded vertex coloring of trees
This page was built for publication: Mutual exclusion scheduling with interval graphs or related classes. II
