Pages that link to "Item:Q4785694"
From MaRDI portal
The following pages link to Approximating Bandwidth by Mixing Layouts of Interval Graphs (Q4785694):
Displaying 9 items.
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- The interval-merging problem (Q867634) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
