Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex

Authors:
Hiroshi Nagamochi
Affiliations:
The author is with the Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto-shi, 606--8501 Japan. E-mail: nag@amp.i.kyoto-u.ac.jp
Venue:
IEICE - Transactions on Information and Systems
Year:
2007

Citing 0
Cited 1

Minimum degree orderings

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an edge-weighted graph G with a designated vertex v0 such that weights of edges incident to v0 may increase or decrease. We show that, with an O(mn + n2 log n) time preprocessing, a minimum cut of the current G can be computed in O(log n) time per update of weight of any edge {v0, u}.