1542 search results - page 141 / 309 » The metamathematics of random graphs |
125
click to vote
DAGM
2008
Springer
15 years 3 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
128
click to vote
PERCOM
2005
ACM
16 years 1 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...
115
click to vote
APPROX
1998
Springer
15 years 6 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...
110
click to vote
JSAT
2006
15 years 1 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 ...
SIAMDM
2008
15 years 1 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...