Graph coloring is a central problem in graph theory and has numerous applications in diverse areas of computer science. An important and well-studied case of graph coloring problems is the (?+1) (vertex) coloring problem where ? is the maximum degree of the graph. Not only does every graph admit a (? + 1) coloring, but in fact we can find one quite easily in linear time and space via a greedy algorithm. But are there more efficient algorithms for (?+1) coloring that can process massive graphs that even this algorithm cannot handle? This talk overviews recent results that answer this question in affirmative across a variety of models dedicated to processing massive graphs - streaming, sublinear-time, massively parallel computation, distribut...
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at mos...
We explore the interplay between architectures and algorithm design in the context of shared-memory ...
18 pages, 2 figures - v2 a couple of remarks have been added in the introduction and the conclusionI...
We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
Graph coloring is one of the central problems in distributed graph algorithms. Much of the research ...
An extremely simple distributed randomized algorithm is presented which with high probability proper...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
We present an efficient and scalable Coarse Grained Multicomputer(CGM) coloring algorithm that color...
A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident...
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$colors using a simple greed...
In the previous week we have seen some algorithms for basic graph problems such as connected compone...
This paper reviews the current state of the literature surrounding methods for the general graph col...
International audienceThe graph coloring problem appears in numerous applications, yet many state-of...
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at mos...
We explore the interplay between architectures and algorithm design in the context of shared-memory ...
18 pages, 2 figures - v2 a couple of remarks have been added in the introduction and the conclusionI...
We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u...
We have developed a new algorithm and software for graph coloring by systematically combining severa...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
Graph coloring is one of the central problems in distributed graph algorithms. Much of the research ...
An extremely simple distributed randomized algorithm is presented which with high probability proper...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
We present an efficient and scalable Coarse Grained Multicomputer(CGM) coloring algorithm that color...
A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident...
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$colors using a simple greed...
In the previous week we have seen some algorithms for basic graph problems such as connected compone...
This paper reviews the current state of the literature surrounding methods for the general graph col...
International audienceThe graph coloring problem appears in numerous applications, yet many state-of...
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at mos...
We explore the interplay between architectures and algorithm design in the context of shared-memory ...
18 pages, 2 figures - v2 a couple of remarks have been added in the introduction and the conclusionI...