Improved bandwidth approximation for trees and chordal graphs
From MaRDI portal
Recommendations
Cited in
(23)- Approximating the bandwidth via volume respecting embeddings
- Tractabilities and intractabilities on geometric intersection graphs
- Approximating the bandwidth of caterpillars
- Approximating bandwidth by mixing layouts of interval graphs
- Thread graphs, linear rank-width and their algorithmic applications
- Combinatorial theorems about embedding trees on the real line
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Bandwidth Minimization: An approximation algorithm for caterpillars
- scientific article; zbMATH DE number 1304325 (Why is no real title available?)
- scientific article; zbMATH DE number 1775392 (Why is no real title available?)
- Volume in general metric spaces
- Approximating Bandwidth by Mixing Layouts of Interval Graphs
- scientific article; zbMATH DE number 1445378 (Why is no real title available?)
- Line-distortion, bandwidth and path-length of a graph
- On semidefinite programming bounds for graph bandwidth
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Hardness results for approximating the bandwidth
- Bandwidth and profile minimization
- Approximation algorithms for the bandwidth minimization problem for a large class of trees
- Bandwidth parameterized by cluster vertex deletion number
- Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing
- Graph bandwidth of weighted caterpillars
- On the graph turnpike problem
This page was built for publication: Improved bandwidth approximation for trees and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746436)
