Pages that link to "Item:Q1906576"
From MaRDI portal
The following pages link to Optimal labelling of unit interval graphs (Q1906576):
Displaying 9 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
