Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming

Authors:
Muralidharan Kodialam;James B. Orlin
Affiliations:
Operations Research Center, MIT;Sloan School of Management, MIT
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Testing for cycles in infinite graphs with periodic structure

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Detecting cycles in dynamic graphs in polynomial time

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial algorithms for minimum cost paths in periodic graphs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Hi-index	0.00