513 search results - page 26 / 103 » Soft Edge Coloring |
111
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
VRST
2006
ACM
15 years 6 months ago
2006
ACM
This paper studies the usage of the GPU as a collection of groups of related processing units, where each group communicates in some way to complete a computation efficiently and...
115
Voted
CCCG
2009
15 years 1 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
109
Voted
MIRAGE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
104
Voted
SIAMDM
2008
15 years 12 days ago
2008
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...