An optimistic and conservative register assignment heuristic for chordal graphs.
Philip BriskAjay K. VermaPaolo IennePublished in: CASES (2007)
Keyphrases
- undirected graph
- graph matching
- maximum independent set
- minimum spanning tree
- optimal solution
- dynamic programming
- graph theoretic
- graph representation
- graph theory
- graph mining
- simulated annealing
- graph databases
- solution quality
- beam search
- graph search
- graph structure
- graph partitioning
- constraint programming
- heuristic methods
- tabu search
- search algorithm