Dynamic Cycle Detection


This paper presents algorithms for maintaining a directed acyclic graph in a dynamically changing environment. In such an environment, nodes and edges are occasionally added and deleted. The underlying idea is to perform a depth first search after each edge addition. Heuristics are presented to make fewer and relatively short searches. The problem of… (More)
DOI: 10.1016/0020-0190(83)90038-8


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.