513 search results - page 4 / 103 » Soft Edge Coloring |
109
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
64
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
COMBINATORICS
2007
15 years 11 days ago
2007
134
click to vote
ALGORITHMICA
2002
15 years 7 days ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
123
Voted
PAMI
2007
14 years 12 months ago
2007
—We propose an automatic approach to soft color segmentation, which produces soft color segments with an appropriate amount of overlapping and transparency essential to synthesiz...