An Incremental Distributed Algorithm for Computing Biconnected Components
- Bala Swaminathan,
Kenneth J. Goldman
This paper presents a distributed algorithm that is useful for
efficient implementation of causal ordering of data delivery in the
I/O abstraction context.
The technical report version is available as
postscript (.ps) or
compressed postscript (.ps.Z).
Proceedings of the Eighth International
Workshop on Distributed Algorithms (WDAG), Terschelling, Netherlands,
September 1994, pp. 238-252.
Long version to appear in Algorithmica.
Washington University Department of Computer Science WUCS-94-06, March 1994.
Prepared by
T. Paul McCartney
(paul@cs.wustl.edu)
Washington University Department of Computer Science