1949 search results - page 128 / 390 » Random graphs on surfaces |
136
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
128
click to vote
RANDOM
2001
Springer
15 years 9 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
115
click to vote
ACMSE
1992
ACM
15 years 8 months ago
1992
ACM
Ray-tracing is a well-known method for producing realistic images. If we wish to view a ray-traced image stereoscopically, we must create two distinct views of the image: a left-e...
133
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
162
click to vote
TVCG
2012
13 years 6 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...