Pages that link to "Item:Q2746436"
From MaRDI portal
The following pages link to Improved bandwidth approximation for trees and chordal graphs (Q2746436):
Displaying 17 items.
- Volume in general metric spaces (Q464741) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- On the graph turnpike problem (Q989483) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Approximating bandwidth by mixing layouts of interval graphs (Q2741348) (← links)
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607) (← links)
- Approximating the bandwidth via volume respecting embeddings (extended abstract) (Q4542524) (← links)
- (Q4952701) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479359) (← links)