S.R. Vegdahl. Using node merging to enhance graph coloring. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vol.34, No. 5, pp.150-4, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... wireless spectrum estimation [Kha98] circuit clustering [Sin99] and multi layer planar routing [Con93] Optimization algorithms for graph coloring may be classified into three major classes: exact [Bre79, Cou97] heuristic constructive [Kar98, Hal93, Lei79] and iterative (1) improvement [Cha87, Mor86, Veg99]. In addition several specialized hardware platforms for efficient graph coloring has been developed including, ones based on couplet oscillators [Wu98] and reconfigurable FPGAs [Lee98] Fig. 3. Generic Non Greedy Probabilistic Iterative Improvement Procedure The graph coloring problem can be ....

S.R. Vegdahl. Using node merging to enhance graph coloring. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vol.34, No. 5, pp.150-4, 1999.

....nodes since it removes copies as well as exploiting the positive impact. In fact, we can use any heuristic for coalescing non copy related pairs, but we empirically found that optimistic coalescing is the best. The positive impact of coalescing has recently been noted independently by Vegdahl [14], who has also proposed the coalescing of non copy related nodes for facilitating the simplification of the graph (which has been published later than our earlier work [15] though) His merge enhanced graph coloring algorithm uses a measurement called pair score which estimates the gain of ....

S. R. Vegdahl. Using node merging to enhance graph coloring. In Proceedings of the ACM PLDI '99, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC