Computing Minimum Cut Sets for Circular-Arc Graphs | a New Approach

Abstract

Let A be a set of n arcs on the unit circle. We present a new simple (n logn)-time algorithm for computing a minimum cut set for A (and a maximum independent subset of A). Our solution is based on a dynamic maintenance scheme for a set S of n intervals on the line, that enables us to update the current minimum cut set for S, following an insertion or a deletion of an interval, in time O(c logn), where c is the size of the current minimum cut set.

1 Figure or Table

Cite this paper

@inproceedings{Katz1999ComputingMC, title={Computing Minimum Cut Sets for Circular-Arc Graphs | a New Approach}, author={Matthew J. Katz and Frank Nielsen and Michael Segal}, year={1999} }