Routing with critical paths
From MaRDI portal
Recommendations
Cites work
- A polynomial algorithm for the min-cut linear arrangement of trees
- A variation on the min cut linear arrangement problem
- Complexity Results for Bandwidth Minimization
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Flit-serial packet routing on meshes and tori
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- On optimal linear arrangements of trees
- One-dimensional logic gate assignment and interval graphs
- Some simplified NP-complete graph problems
This page was built for publication: Routing with critical paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910228)