1949 search results - page 50 / 390 » Random graphs on surfaces |
116
click to vote
CGF
2008
14 years 12 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
122
click to vote
CISS
2007
IEEE
15 years 3 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
ICML
2006
IEEE
16 years 20 days ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
115
click to vote
ESA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...