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

DOI10.1016/S0898-1221(97)00239-3zbMath0904.68124OpenAlexW1976278025MaRDI QIDQ1130417

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)

Cites Work

• Unnamed Item
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks
• Multiple-way network partitioning
• Linear placement algorithms and applications to VLSI design
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Optimal Linear Ordering

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