Wagner Donald K.

Donald K. Wagner

Information about the author Donald K. Wagner will soon be added to the site.
Found 5 papers in total
Shortest paths in almost acyclic graphs
Shortest paths in almost acyclic graphs
2000
This paper presents an algorithm for the shortest-path problem on a directed graph...
The arborescence-realization problem
The arborescence-realization problem
1995
A {0,1}-matrix M is arborescence graphic if there exists an arborescence T such that...
On the k-cut subgraph polytope
On the k-cut subgraph polytope
1994
The authors consider the problem of finding a minimum-cost set of k- pairwise-disjoint...
A polynomial-time simplex method for the maximum k-flow problem
A polynomial-time simplex method for the maximum k-flow problem
1993
A generalization of the maximum-flow problem is considered in which every unit of flow...
Representation of bicircular matroids
Representation of bicircular matroids
1991
A bicircular matroid is a matroid defined on the edge set of a graph. Two different...
Papers per page: