Affiliation:
1. University of Michigan, Ann Arbor, Michigan
Abstract
The consistency of precedence matrices is studied in the very natural geometric setting of the theory of directed graphs. An elegant recent procedure (Marimont [7]) for checking consistency is further justified by means of a graphical lemma. In addition, the “direction of future work” mentioned in [7] (to which the present communication may be regarded as a sequel) is developed here using graph theoretic methods. This is based on the relationship between the occurrence of directed cycles and the recognition of “strongly connected components” in a directed graph. An algorithm is included for finding these components in any directed graph. This is necessarily more complicated than determining whether there do not exist any directed cycles, i.e., whether or not a given precedence matrix is consistent.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference8 articles.
1. HA~nY, A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues;F;J. Math. Phys.,1959
2. HAP~Rr, Graph theoretic methods in the management sciences;F;Management Science,1959
3. HARARY, The number of functional digraphs;F;Math. Ann.,1959
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantales for Uncertainty in Design Engineering;Proceedings of Fifth International Congress on Information and Communication Technology;2020-10-01
2. On Cycle Controllable Matrices over Antirings;Advances in Intelligent Systems and Computing;2013-11-27
3. On nilpotency of generalized fuzzy matrices;Fuzzy Sets and Systems;2010-08
4. On nilpotent matrices over distributive lattices;Fuzzy Sets and Systems;2005-04
5. Early Computer Science Adventures of a Mathematician;Combinatorics, Computability and Logic;2001