Methods for Checking the Consistency of Precedence Constraints
- 1 June 1980
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 12 (2) , 170-178
- https://doi.org/10.1080/05695558008974504
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Cycle detection in critical path networksInformation Processing Letters, 1978
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975
- On the time required to detect cycles and connectivity in graphsTheory of Computing Systems, 1972
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- An Algorithm for Finding a Minimum Equivalent Graph of a DigraphJournal of the ACM, 1969
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrixCommunications of the ACM, 1968
- On the Consistency of Precedence MatricesJournal of the ACM, 1960
- A New Method of Checking the Consistency of Precedence MatricesJournal of the ACM, 1959
- On weakly ordered systemsBulletin of the American Mathematical Society, 1946