Pages that link to "Item:Q3483315"

The following pages link to Computing the Bandwidth of Interval Graphs (Q3483315):

Displaying 33 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)
• Subgraph isomorphism in graph classes (Q456655) (← 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)
• Bandwidth on AT-free graphs (Q650939) (← links)
• Simple linear time recognition of unit interval graphs (Q672408) (← links)
• Discovering bands from graphs (Q736508) (← links)
• Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
• Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
• Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
• Bandwidth of theta graphs with short paths (Q1197053) (← links)
• Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
• Bandwidth and density for block graphs (Q1584358) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
• Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
• Approximating bandwidth by mixing layouts of interval graphs (Q2741348) (← links)
• Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
• Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
• On Harpers' Result Concerning the Bandwidths of Graphs (Q3366636) (← links)
• Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
• Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (Q3512470) (← links)
• (Q3731639) (← links)
• Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
• (Q5136273) (← links)
• Faster Exact Bandwidth (Q5302047) (← links)
• Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)