Computing the Bandwidth of Interval Graphs
From MaRDI portal
Publication:3483315
Recommendations
Cited in
(38)- An exponential time 2-approximation algorithm for bandwidth
- Hardness and approximation of minimum distortion embeddings
- Bandwidth on AT-free graphs
- Hardness results for approximating the bandwidth
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Faster Exact Bandwidth
- Approximating bandwidth by mixing layouts of interval graphs
- Bandwidth of bipartite permutation graphs in polynomial time
- An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
- Simple linear time recognition of unit interval graphs
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
- Subgraph isomorphism in graph classes
- Approximability of the path-distance-width for AT-free graphs
- Approximating the bandwidth via volume respecting embeddings
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
- Bandwidth of convex bipartite graphs and related graphs
- Approximating the bandwidth for asteroidal triple-free graphs
- scientific article; zbMATH DE number 3963886 (Why is no real title available?)
- Bandwidth of chain graphs
- scientific article; zbMATH DE number 3974992 (Why is no real title available?)
- Tractabilities and intractabilities on geometric intersection graphs
- Approximating the path-distance-width for AT-free graphs and graphs in related classes
- Discovering bands from graphs
- On Harpers' Result Concerning the Bandwidths of Graphs
- Finding the minimum bandwidth of an interval graph
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Bandwidth of theta graphs with short paths
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Bandwidth and density for block graphs
- Mixed search number and linear-width of interval and split graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Degree bounds for linear discrepancy of interval orders and disconnected posets
- scientific article; zbMATH DE number 4075107 (Why is no real title available?)
- Computing \(k\)-atomicity in polynomial time
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Line-distortion, bandwidth and path-length of a graph
This page was built for publication: Computing the Bandwidth of Interval Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483315)
