Frank A.

A. Frank

Information about the author A. Frank will soon be added to the site.
Found 3 papers in total
Covering symmetric supermodular functions by graphs
Covering symmetric supermodular functions by graphs
1999
The minimum number of edges of an undirected graph covering a symmetric, supermodular...
Directed vertex-connectivity augmentation
Directed vertex-connectivity augmentation
1999
The problem of finding a smallest set of new edges to be added to a given directed...
Increasing the rooted-connectivity of a digraph by one
Increasing the rooted-connectivity of a digraph by one
1999
D.R. Fulkerson described a two-phase greedy algorithm to find a minimum cost spanning...
Papers per page: