References
Facsimile [PDF, 1.5M]

An Extension of a Polynomial Time Algorithm for the Calculation of the Limit State Matrix in a Random Graph

Dmitrii Lozovanu and Stefan Pickl

p. 92-97

    Abstract

    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

    Keywords

    random graph, Markov process, limit state matrix, polynomial time algorithm, decomposition

    Text

    Download Facsimile [PDF, 1.5M]

    References

    Bibliographical reference

    Dmitrii Lozovanu and 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.

    Electronic reference

    Dmitrii Lozovanu and Stefan Pickl, « An Extension of a Polynomial Time Algorithm for the Calculation of the Limit State Matrix in a Random Graph », CASYS [Online], 25 | 2010, Online since 11 September 2024, connection on 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=3192

    Authors

    Dmitrii Lozovanu

    Institute of Mathematics and Computer Science, Academy of Sciences, Academy str., 5, Chisinau, MD- 2028, Moldova

    By this author

    Stefan Pickl

    Institut für Theoretische Informatik, Mathematik und Operations Research, Fakultät fur Informatik, Universität der Bundeswehr, München

    By this author

    Copyright

    CC BY-SA 4.0 Deed