236 search results - page 9 / 48 » A New Neighborhood Based on Improvement Graph for Robust Gra... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
PAMI
2007
13 years 8 months ago
2007
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
DAC
1998
ACM
14 years 9 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
DATE
2004
IEEE
14 years 4 days ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...