Pages that link to "Item:Q1183610"
From MaRDI portal
The following pages link to On finding the minimum bandwidth of interval graphs (Q1183610):
Displaying 12 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Interval-Valued Degrees of Belief: Applications of Interval Computations to Expert Systems and Intelligent Control (Q3114492) (← links)
- Graph layout problems (Q5096816) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
