scientific article; zbMATH DE number 1775392
From MaRDI portal
Publication:4542524
Recommendations
Cited in
(18)- Bandwidth of bipartite permutation graphs in polynomial time
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998
- Approximating the bandwidth via volume respecting embeddings
- Cubicity and bandwidth
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Efficient algorithms for online decision problems
- Improved bandwidth approximation for trees and chordal graphs
- Bandwidth and low dimensional embedding
- On the cubicity of AT-free graphs and circular-arc graphs
- Bandwidth and low dimensional embedding
- scientific article; zbMATH DE number 1833416 (Why is no real title available?)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- A tight bound on approximating arbitrary metrics by tree metrics
- On approximation intractability of the path-distance-width problem
- On dominated _1 metrics
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
- Topological k-metrics
- Topological \(k\)-metrics
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 Q4542524)
