Computing a graph's period quadratically by node condensation
- 1 April 1973
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 4 (4) , 295-303
- https://doi.org/10.1016/0012-365x(73)90166-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrixCommunications of the ACM, 1968
- On the graphs and asymptotic forms of finite boolean relation matrices and stochastic matricesNaval Research Logistics Quarterly, 1957