Graph layout problems
From MaRDI portal
Publication:5096816
DOI10.1007/3-540-55808-X_2zbMath1493.68265OpenAlexW1495826360MaRDI QIDQ5096816
No author found.
Publication date: 18 August 2022
Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55808-x_2
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Parallel algorithms for the minimum cut and the minimum length tree layout problems ⋮ Efficient parallel algorithms for some tree layout problems ⋮ Book embeddings and crossing numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for solving VLSI graph layout problems
- Black-white pebbles and graph separation
- Towards a complexity theory of synchronous parallel computation
- On finding the minimum bandwidth of interval graphs
- Optimization, approximation, and complexity classes
- The NP-completeness of the bandwidth minimization problem
- Some simplified NP-complete graph problems
- Algorithmic graph theory and perfect graphs
- Minimizing the bandwidth of sparse symmetric matrices
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Simulation of Parallel Random Access Machines by Circuits
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- Complexity Results for Bandwidth Minimization
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- Optimal Linear Ordering
- Optimal numberings and isoperimetric problems on graphs
- A Review of the Placement and Quadratic Assignment Problems
This page was built for publication: Graph layout problems