Adaptive negative cycle detection in dynamic graphs

ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

Volumn 5, Issue , 2001, Pages 163-166

  Chandrachoodan, Nitin ^a   Bhattacharyya, Shuvra S ^a,b   Liu, K J Ray ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED DESIGN; DATA FLOW GRAPHS; GRAPHIC METHODS; ITERATIVE METHODS; SYSTEMS ANALYSIS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; GRAPH THEORY;

AUTOMATED SEARCHES; BELLMAN-FORD ALGORITHMS; CYCLE DETECTION; DESIGN SPACE EXPLORATION; FAST IMPLEMENTATION; HARDWARE AND SOFTWARE; ITERATIVE DESIGN; MAXIMUM CYCLE MEAN;

DATA FLOW ANALYSIS; SYSTEMS ANALYSIS;

ADAPTIVE NEGATIVE CYCLE DETECTION;

EID: 0035014385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscas.2001.922010     Document Type: Conference Paper

References (12)

1. B. Cherkassky and A. V. Goldberg, "Negative cycle detection algorithms, " Tech. Rep. tr-96-029, NEC Research Institute, Inc., March 1996.
2. G. Ramalingam, J. Song, L. Joskowicz, and R. E. Miller, "Solving systems of difference constraints incrementally, " Aigorithmica, vol. 23, pp. 261-275, 1999.
3. A. Dasdan, S. S. Irani, and R. K. Gupta, "Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems, " in 36th Design Automation Conference, pp. 37-42, ACM/IEEE, 1999.
4. G. Ramalingam, Bounded Incremental Computation. PhD thesis, University of Wisconsin, Madison, August 1993. Revised version published by Springer Verlag (1996) as Lecture Notes in Computer Science 1089.
5. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, "Fully dynamic shortest paths and negative cycle detection on digraphs with arbitrary arc weights, " in ESA98, vol. 1461 of Lecture Notes in Computer Science, (Venice, Italy), pp. 320-331, Springer, August 1998.
6. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck, "Incremental evaluation of computational circuits, " in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, pp. 32-42, 1990.
7. J. Cochet-Terrasson, G. Cohen, S. Gaubert, M. McGettrick, and J.-P. Quadrat, "Numerical computation of spectral elements in max-plus algebra, " in Proc. IFAC Conf. on Syst. Structure and Control, 1998.
8. K. Mehlhorn and S. Naher, "LEDA: A platform for combinatorial and geometric computing, " Communications of the ACM, vol. 38, no. 1, pp. 96-102, 1995.
9. N. Chandrachoodan, S. S. Bhattacharyya, and K. J. R. Liu, "Negative cycle detection in dynamic graphs, " Tech. Rep. UMIACS-TR-99-59, University of Maryland Institute for Advanced Computer Studies, September 1999. http:/Avw w. cs. umd. edu/TRs/TRumiacs. html.
10. E. Lawler, Combinatorial Optimization: Networks and Ma-troids. New York: Holt, Rhinehart and Winston, 1976.
11. M. Sarrafzadeh and S. Raje, "Scheduling with multiple voltages under resource constraints, " in Proc. ISCAS 99, 1999.
12. S. M. H. de Groot, S. H. Gerez, and O. E. Herrmann, "Range-chart- guided iterative data-flow graph scheduling, " IEEE Transactions on Circuits and Systems-I, vol. 39, pp. 351-364, May 1992.