Processor optimization for flow graphs

DOI10.1016/0304-3975(92)90126-ZMaRDI QIDQ1200808zbMATH OpenFDO

Authors 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)

Recommendations

• Processor-efficient implementation of a maximum flow algorithm
• scientific article; zbMATH DE number 3907743
• Parallel Algorithms for Reducible Flow Graphs
• scientific article; zbMATH DE number 19351
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• Approximation algorithms for combinatorial problems
• Efficient algorithms for interval graphs and circular-arc graphs
• On a property of the class of n-colorable graphs
• On the ratio of optimal integral and fractional covers
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(11)

• scientific article; zbMATH DE number 1391398 (Why is no real title available?)
• The allocation problem in hardware design
• Graph-Theoretic Concepts in Computer Science
• On the complexity of allocation problems in high-level synthesis
• scientific article; zbMATH DE number 19351 (Why is no real title available?)
• A minimization version of a directed subgraph homeomorphism problem
• scientific article; zbMATH DE number 3907743 (Why is no real title available?)
• scientific article; zbMATH DE number 598111 (Why is no real title available?)
• An approximation algorithm for the license and shift class design problem
• Transfer flow graphs
• Restrictions of graph partition problems. I

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

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