Abstract
Let G = (V, E) be an undirected graph, S be a subset of its vertices, ts be the set of minimum edge-cuts partitioning S. A data structure representing both cuts in I.Z,S and the partition of V by all these cuts is suggested. One can build it in ISI - 1 max-flow computations in G. It can be maintained, for an arbitrary sequence of u edge insertions, in O(min{]V]. Il?l, klV12 +wa(u, IVI)}) time, where k is the size of a cut in C.g. For two vertices of G, queries asking whether they are separated by a cut in C.S are answered in O (a (q, IV t) ) amortized time per query, where q is the number of queries; such a cut itself is shown in O ( IVI ) amortized time. The dag representation of all cuts in C,S separating two given vertices in S is obtained in O(min{lEl, klVl}) amortized time.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994 |
| Publisher | Association for Computing Machinery |
| Pages | 716-725 |
| Number of pages | 10 |
| ISBN (Electronic) | 0897916638 |
| DOIs | |
| State | Published - 23 May 1994 |
| Externally published | Yes |
| Event | 26th Annual ACM Symposium on Theory of Computing, STOC 1994 - Montreal, Canada Duration: 23 May 1994 → 25 May 1994 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
|---|---|
| Volume | Part F129502 |
| ISSN (Print) | 0737-8017 |
Conference
| Conference | 26th Annual ACM Symposium on Theory of Computing, STOC 1994 |
|---|---|
| Country/Territory | Canada |
| City | Montreal |
| Period | 23/05/94 → 25/05/94 |
Bibliographical note
Funding Information:1This research was supported by Research at the Technion, Israel. ‘2up to IWO: E. A. Dinic, MOSCOW.
Publisher Copyright:
© 1994 ACM.
ASJC Scopus subject areas
- Software