86 search results - page 14 / 18 » Worst-Case Running Times for Average-Case Algorithms |
SODA
2010
ACM
14 years 6 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...
CCS
2006
ACM
13 years 10 months ago
2006
ACM
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
ESA
2006
Springer
14 years 6 days ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
TVLSI
2008
13 years 8 months ago
2008
Abstract--Technology scaling in the nanometer era has increased the transistor's susceptibility to process variations. The effects of such variations are having a huge impact ...