17 search results - page 1 / 4 » Solving the Replacement Paths Problem for Planar Directed Gr... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
TASE
2010
IEEE
12 years 11 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...