4 search results - page 1 / 1 » Subcubic Equivalences between Path, Matrix and Triangle Prob... |
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We say an algorithm on n
170
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
131
Voted
COMGEO
2006
ACM
15 years 9 days ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
123
click to vote
FCT
2003
Springer
15 years 5 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...