Add to ORKGSIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and...
SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...
AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractWe design an O(nm) algorithm to find a minimum weighted colouring and a maximum weighted cli...
in Journées Informatiques de Metz - JIM'2000 (IUT Metz). Colloque avec actes sans comité de lecture....
Abstract. Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). A multic...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
AbstractMotivated by an application to load balancing in data-parallel finite element methods, we co...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and...
SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...
AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractWe design an O(nm) algorithm to find a minimum weighted colouring and a maximum weighted cli...
in Journées Informatiques de Metz - JIM'2000 (IUT Metz). Colloque avec actes sans comité de lecture....
Abstract. Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). A multic...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
AbstractMotivated by an application to load balancing in data-parallel finite element methods, we co...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and...
SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...
AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...