An Extension of a Polynomial Time Algorithm for the Calculation of the Limit State Matrix in a Random Graph
p. 92-97
Résumé
A characterization of a simple Markov process based on a random graph theoretic structure is introduced. We propose a polynomial time algorithm for the calculation of a limit state matrix. The algorithm is based on two procedures which will be derived in this contribution. They exploit a distinguished decomposition principle of the underlying graph theoretic structure and the special property of an acyclic directed graph.
Index
Texte
Citer cet article
Référence papier
Dmitrii Lozovanu et Stefan Pickl, « An Extension of a Polynomial Time Algorithm for the Calculation of the Limit State Matrix in a Random Graph », CASYS, 25 | 2010, 92-97.
Référence électronique
Dmitrii Lozovanu et Stefan Pickl, « An Extension of a Polynomial Time Algorithm for the Calculation of the Limit State Matrix in a Random Graph », CASYS [En ligne], 25 | 2010, mis en ligne le 11 September 2024, consulté le 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=3192
Auteurs
Dmitrii Lozovanu
Institute of Mathematics and Computer Science, Academy of Sciences, Academy str., 5, Chisinau, MD- 2028, Moldova
Stefan Pickl
Institut für Theoretische Informatik, Mathematik und Operations Research, Fakultät fur Informatik, Universität der Bundeswehr, München