Efficient algorithms for single- and two-layer linear placement of parallel graphs

DOI10.1016/S0898-1221(97)00239-3MaRDI QIDQ1130417zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 11 January 1999

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(97)00239-3

zbMATH Keywords

optimum linear ordering

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

Recommendations

• Minimum Linear Arrangement of Series-Parallel Graphs
• Linear placement algorithms and applications to VLSI design
• Parallel algorithms for the minimum cut and the minimum length tree layout problems
• On optimal linear arrangements of trees
• Multilevel algorithms for linear ordering problems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks
• Linear placement algorithms and applications to VLSI design
• Multiple-way network partitioning
• Optimal Linear Ordering

Cited in

(1)

• Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning

This page was built for publication: Efficient algorithms for single- and two-layer linear placement of parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130417)