1749 search results - page 94 / 350 » Conditional colorings of graphs |
154
click to vote
ARSCOM
2005
15 years 6 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
189
click to vote
ICMCS
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
159
click to vote
WG
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
127
click to vote
RSA
2006
15 years 6 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...
159
click to vote
CGO
2007
IEEE
16 years 23 days ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...