Pages that link to "Item:Q1090458"
From MaRDI portal
The following pages link to Finding the minimum bandwidth of an interval graph (Q1090458):
Displaying 14 items.
- Discovering bands from graphs (Q736508) (← links)
- On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs (Q1802068) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Profile minimization on products of graphs (Q2495515) (← links)
- Laying out sparse graphs with provably minimum bandwidth (Q2890478) (← links)
- Computing the Bandwidth of Interval Graphs (Q3483315) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)