2079 search results - page 45 / 416 » Universality of random graphs |
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
112
click to vote
TACAS
2010
Springer
14 years 12 months ago
2010
Springer
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
126
click to vote
MFCS
2005
Springer
15 years 7 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...
108
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
121
click to vote
DCG
2008
15 years 2 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...