AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
A graph is a mathematical abstraction that is useful in solving a variety of problems. NP-complete (...
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is,...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...
An extremely simple distributed randomized algorithm is presented which with high probability proper...
An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...
AbstractWe present an efficient algorithm for edge coloring a planar graphG. Let n be the number of ...
An outerplanar graph is a graph which can be embedded in the plane so that all vertices lie on the b...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
AbstractWe give a distributed randomized algorithm for graph edge colouring. Let G be a Δ-regular gr...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
We give a distributed randomized algorithm to edge colour a network. Let G be a graphwith n nodes an...
AbstractA b-colouring of a graph is a colouring of its vertices such that every colour class contain...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
A graph is a mathematical abstraction that is useful in solving a variety of problems. NP-complete (...
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is,...
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...
AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...
An extremely simple distributed randomized algorithm is presented which with high probability proper...
An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...
AbstractWe present an efficient algorithm for edge coloring a planar graphG. Let n be the number of ...
An outerplanar graph is a graph which can be embedded in the plane so that all vertices lie on the b...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
AbstractWe give a distributed randomized algorithm for graph edge colouring. Let G be a Δ-regular gr...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
We give a distributed randomized algorithm to edge colour a network. Let G be a graphwith n nodes an...
AbstractA b-colouring of a graph is a colouring of its vertices such that every colour class contain...
AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
A graph is a mathematical abstraction that is useful in solving a variety of problems. NP-complete (...
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is,...
DOI
Add to ORKG