9532 search results - page 261 / 1907 » Logic, Graphs, and Algorithms |
174
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
174
Voted
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
140
Voted
COMBINATORICS
2000
15 years 6 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
159
click to vote
ISAAC
2007
Springer
16 years 9 days ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
239
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...