After having given the definitions of the 7 different labellings called bandwidth labelling, cyclic bandwith labelling, profile labelling, fill-in labelling, cutwidth labelling, modified cutwidth labelling, and bandwidth sum labelling, the two authors show for every unit interval graph the existence of a labelling that is simultaneously optimal for the 7 labellings mentioned above.
Recommendations
Cites work
Cited in
(9)- Embedding ray intersection graphs and global curve simplification
- On cutwidth parameterized by vertex cover
- Computing the cutwidth of bipartite permutation graphs in linear time
- Tabu search for the cyclic bandwidth problem
- Lower and upper bounds for the linear arrangement problem on interval graphs
- On cutwidth parameterized by vertex cover
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- Maximum cut on interval graphs of interval count four is NP-complete
- Semi-proper interval graphs
This page was built for publication: Optimal labelling of unit interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906576)
