This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select a set of algorithms that are among the asymptotically fastest known today. Each algorithm has exponential time complexity, owing to the NP-completeness of edge coloring, but their space complexities differ greatly. They are implemented in a popular high-level programming language to compare their performance on a set of real instances. We also explore ways to parallelize each of the algorithms and discuss what benefits and detriments those implementations hold
An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...
International audienceThe Grundy index of a graph G = (V, E) is the greatest number of colours that ...
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple u...
This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
The work in this thesis can be divided into two different parts. In the first part, we suggest an ap...
We show an O(1.344n) = O(20.427n) algorithm for edge-coloring an n-vertex graph using three colors....
International audienceMotivated by some algorithmic considerations, we are interested in computing t...
AbstractWe show an O(1.344n)=O(20.427n) algorithm for edge-coloring an n-vertex graph using three co...
The edge coloring problem asks for an assignment of colors to edges of a graph such that no two inci...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
Abstract. We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The...
A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident...
Submitted by SUELEN SPINDOLA BILHAR (suelen.bilhar@gmail.com) on 2019-03-08T13:26:30Z No. of bitstre...
This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...
An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...
International audienceThe Grundy index of a graph G = (V, E) is the greatest number of colours that ...
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple u...
This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
The work in this thesis can be divided into two different parts. In the first part, we suggest an ap...
We show an O(1.344n) = O(20.427n) algorithm for edge-coloring an n-vertex graph using three colors....
International audienceMotivated by some algorithmic considerations, we are interested in computing t...
AbstractWe show an O(1.344n)=O(20.427n) algorithm for edge-coloring an n-vertex graph using three co...
The edge coloring problem asks for an assignment of colors to edges of a graph such that no two inci...
AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...
Abstract. We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The...
A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident...
Submitted by SUELEN SPINDOLA BILHAR (suelen.bilhar@gmail.com) on 2019-03-08T13:26:30Z No. of bitstre...
This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...
An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...
International audienceThe Grundy index of a graph G = (V, E) is the greatest number of colours that ...
We conduct an experimental analysis of a distributed randomized algorithm for edge coloring simple u...
Add to ORKG