scientific article; zbMATH DE number 1445378
From MaRDI portal
Publication:4952701
Recommendations
- Improved bandwidth approximation for trees and chordal graphs
- scientific article; zbMATH DE number 4134066
- On upper bounds of bandwidths of trees
- Approximation algorithms for the bandwidth minimization problem for a large class of trees
- Parameterized complexity of bandwidth on trees
- scientific article; zbMATH DE number 3963887
- An improvement of Reed's treewidth approximation
- An improvement of Reed's treewidth approximation
- On treewidth approximations
- Publication:4863471
Cited in
(14)- Bandwidth of bipartite permutation graphs in polynomial time
- Approximating the bandwidth via volume respecting embeddings
- Approximating the bandwidth of caterpillars
- Improved bandwidth approximation for trees and chordal graphs
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- scientific article; zbMATH DE number 3914372 (Why is no real title available?)
- scientific article; zbMATH DE number 3963887 (Why is no real title available?)
- scientific article; zbMATH DE number 1775392 (Why is no real title available?)
- Retracting Graphs to Cycles
- Parameterized complexity of bandwidth on trees
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for the bandwidth minimization problem for a large class of trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952701)
