On minimum cuts and the linear arrangement problem
From MaRDI portal
Publication:1570828
DOI10.1016/S0166-218X(00)00173-6zbMath0958.68136MaRDI QIDQ1570828
R. Gary Parker, Steven B. Horton, Richard B. Borie
Publication date: 11 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (6)
On the queue number of planar graphs ⋮ Edge-treewidth: algorithmic and combinatorial properties ⋮ An improved upper bound on the queue number of planar graphs ⋮ Lower and upper bounds for the linear arrangement problem on interval graphs ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Minimum linear arrangement of chord graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On optimal linear arrangements of trees
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Optimal linear labelings and eigenvalues of graphs
- Generating lower bounds for the linear arrangement problem
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Optimal linear arrangement of a rectangular grid
- Easy problems for tree-decomposable graphs
- On finding spanning eulerian subgraphs
- Planar linear arrangements of outerplanar graphs
- Deterministic Dcomposition of Recursive Graph Classes
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- Optimal Numberings of an $N \times N$ Array
- Optimal Linear Ordering
- Optimal numberings and isoperimetric problems on graphs
This page was built for publication: On minimum cuts and the linear arrangement problem
