FCT
2007
Springer
14 years 5 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...