Tel-Aviv University School of Mathematical Sciences APPLIED MATHEMATICS SEMINAR Time: Tuesday, October 30, 3:15 pm. Place: Room 309 (Schreiber building) Speaker: Dr. Michael Rozinas Title: THE INVERSE PROBLEM OF MAXIMAL NETWORK FLOW Abstract The problem of maximal network flow is well known in operation research. The informal meaning of this problem is as follows. Suppose there is a transport network consisting of several sites, some of which are connected by roads with limited carrying capacity. The problem is to find maximal flow between two selected sites, i.e. maximal possible amount of load which can be delivered from one site (the sourse) to another one (the sink). Formalization of this problem use capacity graph, which is a connected non-oriented weighted graph with a positive weight function representing capacities of the edges. Several well known algorithms for solution of the maximal flow problem allow, for any capacity graph G, to construct a complete weighted graph P=M(G) of maximal flows. The graph P has the same set of vertices, and each couple of distinct vertices in P is connected by an edge with a weight equal to the maximal flow between these vertices in G. Suppose a complete weighted graph P with positive weights of all edges is given. Does there exist a weighted graph G, satisfying condition P=M(G)? How to reconstruct the capacity graph G if it exists? The subject of the talk is the solution of this inverse maximal flow problem. This is a joint work with T. Silaeva. --------------------------------------------------------- >>Technion Mathematics Net 2 [TECHMATH2] (Editor: Eddy Mayer-Wolf)<< Announcement from: Alexander Shnirelman