1949 search results - page 43 / 390 » Random graphs on surfaces |
ICDT
2007
ACM
15 years 6 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 α >...
STOC
1991
ACM
15 years 3 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
102
click to vote
MFCS
2005
Springer
15 years 5 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...
101
click to vote
SIAMIS
2010
14 years 6 months ago
2010
It is known that cross correlation of waves generated by noise sources, propagating in an unknown medium, and recorded by a sensor array, can provide information about the medium. ...
INFOCOM
2006
IEEE
15 years 5 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...