Processor optimization for flow graphs

This publication has 8 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• MacPitts: An Approach to Silicon Compilation
  Computer, 1983
• Efficient algorithms for interval graphs and circular‐arc graphs
  Networks, 1982
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• The CMU Design Automation System - An Example of Automated Data Path Design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• On the ratio of optimal integral and fractional covers
  Discrete Mathematics, 1975
• On a property of the class of n-colorable graphs
  Journal of Combinatorial Theory, Series B, 1974