A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs.
Roy L. RussoPeter H. OdenPeter K. Wolff Sr.Published in: IEEE Trans. Computers (1971)
Keyphrases
- graph partitioning
- search procedure
- mixed integer program
- computer systems
- multi valued
- maximum independent set
- proof procedure
- graph theory
- directed graph
- forward selection
- branch and bound procedure
- modal logic
- graph mining
- automated reasoning
- graph search
- dynamic programming
- tabu search
- optimal solution
- evolutionary algorithm
- asynchronous circuits
- logical framework
- graph theoretic
- graph representation
- constraint satisfaction
- solution quality