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

DOI10.1016/S0898-1221(97)00064-3zbMath0881.05075MaRDI QIDQ1368444

Bernhard Rupp

Publication date: 18 November 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmincidence matrixcyclesPetri netbinary AHPincomplete directed graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

Acceptably consistent incomplete interval-valued intuitionistic multiplicative preference relations ⋮ Group decision making based on incomplete intuitionistic multiplicative preference relations ⋮ An integrated model-based interactive approach to FMAGDM with incomplete preference information ⋮ A survey of preference relations ⋮ A consensus reaching process under incomplete multiplicative preference relations ⋮ A method for repairing the inconsistency of fuzzy preference relations

Cites Work

• A scaling method for priorities in hierarchical structures
• A CONSISTENCY IMPROVING METHOD IN BINARY AHP