Pages that link to "Item:Q4296515"

The following pages link to An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs (Q4296515):

Displaying 20 items.

• Bandwidth of chain graphs (Q293476) (← links)
• An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
• Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
• Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
• Hardness results for approximating the bandwidth (Q619902) (← links)
• Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
• Graph bandwidth of weighted caterpillars (Q860873) (← links)
• Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
• Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
• Restrictions of minimum spanner problems (Q1370655) (← links)
• Bandwidth and density for block graphs (Q1584358) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← 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)
• Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
• (Q2741348) (← links)
• Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
• Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (Q3512470) (← links)
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)