DOIAbstract
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph. This algorithm runs in O((log n)3) time using O(n2m/log n) processors in the CRCW PRAM model
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph. This algorithm runs in O((log n)3) time using O(n2m/log n) processors in the CRCW PRAM model
AbstractWe present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm t...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
A parallel (CRCW PRAM) algorithm is given to find a $k$-coloring of a graph randomly drawn from the ...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
SIGLETIB: RN 4052(90632-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
AbstractWe design an O(nm) algorithm to find a minimum weighted colouring and a maximum weighted cli...
AbstractFew existing parallel graph algorithms achieve optimality when applied to very sparse graphs...
Abstract. Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). A multic...
The all nearest smaller values problem is defined as follows. Let A = (a 1 ; a 2 ; : : : ; an ) be n...
This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...
AbstractWe present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm t...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractWe present a parallel algorithm to find a minimum weighted colouring of a triangulated graph...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
A parallel (CRCW PRAM) algorithm is given to find a $k$-coloring of a graph randomly drawn from the ...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
SIGLETIB: RN 4052(90632-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Graph coloring is an abstraction of scheduling problems. Using an exclusive-read and exclusive-write...
AbstractWe design an O(nm) algorithm to find a minimum weighted colouring and a maximum weighted cli...
AbstractFew existing parallel graph algorithms achieve optimality when applied to very sparse graphs...
Abstract. Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). A multic...
The all nearest smaller values problem is defined as follows. Let A = (a 1 ; a 2 ; : : : ; an ) be n...
This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...
AbstractWe present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm t...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
Article dans revue scientifique avec comité de lecture.We present the first efficient parallel algor...
Add to ORKG