A method to find elements of cycles in an incomplete directed graph and its applications - binary AHP and Petri nets (Q1368444)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method to find elements of cycles in an incomplete directed graph and its applications - binary AHP and Petri nets |
scientific article; zbMATH DE number 1067148
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method to find elements of cycles in an incomplete directed graph and its applications - binary AHP and Petri nets |
scientific article; zbMATH DE number 1067148 |
Statements
A method to find elements of cycles in an incomplete directed graph and its applications - binary AHP and Petri nets (English)
0 references
18 November 1997
0 references
algorithm
0 references
cycles
0 references
incomplete directed graph
0 references
binary AHP
0 references
Petri net
0 references
incidence matrix
0 references
