T. Hagerup

Information about the author T. Hagerup will soon be added to the site.

Found 2 papers in total

Routing flow through a strongly connected graph

2002

It is shown that, for every strongly connected network in which every edge has...

An O(n3/log(n))-time maximum-flow algorithm

1996

We show that a maximum flow in a network with n vertices can be computed...

Papers per page: