Sciweavers

351 search results - page 8 / 71
» An exact method for graph coloring
Sort
View
JCO
2007
130views more  JCO 2007»
13 years 7 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
13 years 9 months ago
On colorings of squares of outerplanar graphs
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
Geir Agnarsson, Magnús M. Halldórsso...
ICMLA
2009
13 years 5 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
ICPR
2008
IEEE
14 years 8 months ago
Nonlocal graph regularization for image colorization
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...
Abderrahim Elmoataz, Olivier Lezoray, Vinh-Thong T...