1591 search results - page 129 / 319 » Random lifts of graphs |
165
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
A novel interactive segmentation framework comprising of a two stage s-t mincut is proposed. The framework has been designed keeping in mind the need to segment touching neuronal ...
171
click to vote
APPROX
1998
Springer
15 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
160
click to vote
JSAT
2006
15 years 6 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
150
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
192
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...