| Article ID: | iaor2008980 |
| Country: | Hungary |
| Volume: | 22 |
| Issue: | 1 |
| Start Page Number: | 13 |
| End Page Number: | 27 |
| Publication Date: | Jan 2005 |
| Journal: | Alkalmazott Matematikai Lapok |
| Authors: | Dsa Gyrgy |
We are looking for shortest path, or maximum flow in time-dependent networks. The problems both are NP-hard, but there are some special and interesting cases, when we can apply some previous classical algorithms to solve the more complicated problems, as well.