Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
- 1 September 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (4) , 791-830
- https://doi.org/10.1145/153724.153727
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Linear Programming with Two Variables Per Inequality in Poly-Log TimeSIAM Journal on Computing, 1990
- A Semiring on Convex Polygons and Zero-Sum Cycle ProblemsSIAM Journal on Computing, 1990
- Planarity testing of doubly periodic infinite graphsNetworks, 1988
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967
- Theorie der einfachen Ungleichungen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1902