52 search results - page 4 / 11 » On the computational complexity of strong edge coloring |
DEXAW
1999
IEEE
13 years 9 months ago
1999
IEEE
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
ALGORITHMICA
2006
13 years 5 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
SPAA
2009
ACM
14 years 2 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
ICMCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Natural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem – we must estimate bo...
CAGD
2010
13 years 5 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...