Pages that link to "Item:Q922724"
From MaRDI portal
The following pages link to An optimal greedy heuristic to color interval graphs (Q922724):
Displaying 11 items.
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)