Pages that link to "Item:Q3975168"
From MaRDI portal
The following pages link to A coloring algorithm for interval graphs (Q3975168):
Displaying 22 items.
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures (Q948134) (← links)
- A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- A linear time approximation algorithm for interval coloring on proper interval graphs (Q2708486) (← links)
- (Q3475285) (← links)
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs (Q3638867) (← links)
- (Q4471379) (← links)
- Computing and Combinatorics (Q4681192) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- Optimal on-line coloring of circular arc graphs (Q4858840) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
- (Q6084415) (← links)
- On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio (Q6115748) (← links)
- Online coloring of short intervals (Q6201896) (← links)