The allocation problem in hardware design

DOI10.1016/0166-218X(93)90167-MzbMath0776.68094OpenAlexW2014569221MaRDI QIDQ1801667

Klaus Jansen

Publication date: 17 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90167-m

zbMATH Keywords

high-level synthesisregister allocation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

Register loading via linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better performance guarantee for approximate graph coloring
• Processor optimization for flow graphs
• Some simplified NP-complete graph problems
• Parallel program schemata
• On a property of the class of n-colorable graphs
• Improving the performance guarantee for approximate graph coloring
• Efficient algorithms for interval graphs and circular-arc graphs
• The Rectilinear Steiner Tree Problem is $NP$-Complete