165 search results - page 21 / 33 » A New Algorithm for On-line Coloring Bipartite Graphs |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
ENDM
2000
13 years 7 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...