1158 search results - page 107 / 232 » Software is discrete mathematics |
116
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
108
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
143
Voted
COMPGEOM
1992
ACM
15 years 4 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
112
click to vote
SIAMSC
2010
14 years 7 months ago
2010
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
242
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...