Sciweavers

720 search results - page 65 / 144
» Nonrepetitive colorings of graphs
Sort
View
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 1 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
ENDM
2007
149views more  ENDM 2007»
13 years 7 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou