Negative Cycle Detection in Dynamic Graphs.pdfVIP

NegativeCycleDetectioninDynamicGraphs ∗ NitinChandrachoodan,ShuvraS.Bhattacharyya andK.J.RayLiu DepartmentofElectricalandComputerEngineering, UniversityofMaryland,CollegePark,MD20742 (nitin,ssb,kjrliu@eng.umd.edu) September30,1999 Abstract We examine the problem of detecting negative cycles in a dynamic graph, which is a fundamental problem that arises in electronic design automation and systems theory [1, 2, 3, 4]. Previous approaches used for this have tried to modify Dijkstra’s algorithm since it is the fastest known Single-Source Shortest Path algorithm. We introduce the concept of batchmodenegative cycle detection, in which a graph changes over time, and negative cycle detection needs to be done periodically. Such scenarios arise, for example, during iterative de- sign space exploration for hardware and software synthesis. We present an algorithm for this problem, based on the Bellman-Ford algorithm, which outperforms previous approaches. We also show that this technique leads to very fast algorithms for the computation of the maximum-cycle mean (MCM) of a graph, especially for a certain form of sparsegraph. Such sparseness often occurs in practice, as demonstrated for example by the ISCAS 89/93 benchmarks. We present experimental results that demonstrate the advantages of our batch-processing techniques, and illustrate their application to design- space exploration by developing an automated local-search technique for multiple-voltage scheduling of iterative data-flow graphs. 1 Introduction Detecting the presence of negative cy