Processor optimization for flow graphs

DOI10.1016/0304-3975(92)90126-ZzbMath0754.68062MaRDI QIDQ1200808

Klaus Jansen

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

assignment problemgeneralized processor optimization problemhardware synthesisincompatibility graphs

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 (3)

An approximation algorithm for the license and shift class design problem ⋮ Restrictions of graph partition problems. I ⋮ The allocation problem in hardware design

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On a property of the class of n-colorable graphs
• A Greedy Heuristic for the Set-Covering Problem
• Efficient algorithms for interval graphs and circular-arc graphs

This page was built for publication: Processor optimization for flow graphs