scientific article; zbMATH DE number 15657

MaRDI QIDQ3972299zbMATH OpenFDO

Authors Rafael Medina Ferro

Publication date 25 June 1992

zbMATH Keywords

connection matrixoriented graphssorting algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

[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.

Recommendations

• A linear algorithm of checking of the graph connectness
• scientific article; zbMATH DE number 1751903
• scientific article; zbMATH DE number 166022
• Clustering algorithm of graphs
• A new algorithm to find all elementary circuits of a directed graph

Cited in

(5)

• A structured program to generate all topological sorting arrangements
• On an algorithm of a generalized graph construction for digital device
• A Forward Lower Restricted Ordering Algorithm for Digraphs
• scientific article; zbMATH DE number 1751903 (Why is no real title available?)
• A linear algorithm of checking of the graph connectness

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972299)