Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...