570 search results - page 23 / 114 » Edge Coloring with Delays |
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
The novel field of fluid lens cameras introduces unique image processing challenges. Intended for surgical applications, these fluid optics systems have improved miniaturizatio...
111
click to vote
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
102
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
110
click to vote
CCCG
2009
15 years 27 days ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...