A method to find elements of cycles in an incomplete directed graph and its applications - Binary AHP and Petri Nets

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we propose an algorithm to find elements of cycles of various lengths in an incomplete directed graph. The proposed algorithm is classified into two cases. We find the cycles of even length and odd length, respectively. In order to find cycles, we need the vertex matrix V corresponding to the directed graph. To find cycles of even length 2m(m = 2,3,...), we use V and Vm. To find cycles of odd length 2m - 1(m = 2,3,...), we use V, Vm-1, and Vm. Then we give two kinds of examples to illustrate the usefulness of the proposed algorithm. One is a binary AHP (Analytic Hierarchy Process) and another is a Petri Net. In binary AHP, we apply our algorithm to measure consistency for incomplete comparison case and suggest misjudgments. In Petri Nets, we have T-invariant sets as byproducts of finding even lengths of cycles from an incidence matrix.

Author supplied keywords

Cite

CITATION STYLE

APA

Nishizawa, K. (1997). A method to find elements of cycles in an incomplete directed graph and its applications - Binary AHP and Petri Nets. Computers and Mathematics with Applications, 33(9), 33–46. https://doi.org/10.1016/S0898-1221(97)00064-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free