SciELO - Scientific Electronic Library Online

 
vol.16 issue4Distributed-Based Transversal Filter Approach for Spectrally Encoded Multi-Gb/s CDMA SystemsAlpha-Beta Cellular Automata author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

PEREZ-PEREZ, Sergio Luis; MORALES-LUNA, Guillermo Benito  and  SAGOLS-TRONCOSO, Feliú Davino. Random Selection of Spanning Trees on Grap. Comp. y Sist. [online]. 2012, vol.16, n.4, pp.457-469. ISSN 1405-5546.

Random selection of spanning trees on graphs has been treated extensively in technical literature. Popular randomized algorithms have time complexity varying from to , where is the order of a graph, namely, the number of vertices. In this work, we introduce effective and efficient procedures to select spanning trees using random walks with the purpose to balance the diameter of the selected tree, the valencies of its inner vertices, and the number of leaves at its yield. We describe several ways to form transition matrices of Markov chains in terms of probability distributions on the neighborhood of any visited vertex along the random walk.

Keywords : Random spanning trees; random walks on graphs; transition matrices in Markov chains; probability distributions on neighborhoods of vertices.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License