No label defined (Q3972299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 15657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15657 |
Statements
25 June 1992
0 references
oriented graphs
0 references
connection matrix
0 references
sorting algorithm
0 references
0.7521591782569885
0 references
0.7206724286079407
0 references
0.7181470394134521
0 references
[For the entire collection see Zbl 0705.00015.] The structure of the derived connection matrix is analyzed and a new algorithm is presented. It permits to generate all the indirect connections in a graph. A theorem supports a sorting algorithm of a graph without circuits. The generating algorithm remains valid when circuits are present. Some changes in the algorithm, which supports the sorting, are introduced. They allow to model some practical problems which are exemplified in the paper.
0 references
