1949 search results - page 165 / 390 » Random graphs on surfaces |
154
click to vote
PERCOM
2005
ACM
16 years 4 months ago
2005
ACM
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
137
click to vote
ICIP
2010
IEEE
15 years 2 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 ...
142
click to vote
APPROX
1998
Springer
15 years 9 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...
138
click to vote
JSAT
2006
15 years 4 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 ...
122
click to vote
SIAMDM
2008
15 years 4 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...