Generalised online colouring problems in overlap graphs
From MaRDI portal
Publication:2034796
Recommendations
Cites work
- A note on online colouring problems in overlap graphs and their complements
- Algorithmic graph theory and perfect graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Coloring circle graphs
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- scientific article; zbMATH DE number 4051024 (Why is no real title available?)
- scientific article; zbMATH DE number 3611388 (Why is no real title available?)
- On split-coloring problems
- On the independence number of random interval graphs
- On the online track assignment problem
- On the performance of the first-fit coloring algorithm on permutation graphs
- Sorting with Complete Networks of Stacks
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Track assignment
Cited in
(3)
This page was built for publication: Generalised online colouring problems in overlap graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034796)