Random spanning trees and the prediction of weighted graphs

被引:0
|
作者
机构
[1] Cesa-Bianchi, Nicolò
[2] Gentile, Claudio
[3] Vitale, Fabio
[4] Zappella, Giovanni
来源
| 1600年 / Microtome Publishing卷 / 14期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] On minimum spanning trees for random Euclidean bipartite graphs
    Correddu, Mario
    Trevisan, Dario
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (03) : 319 - 350
  • [22] Spanning trees in random series-parallel graphs
    Ehrenmueller, Julia
    Rue, Juanjo
    ADVANCES IN APPLIED MATHEMATICS, 2016, 75 : 18 - 55
  • [23] Weighted spanning trees on some self-similar graphs
    D'Angeli, Daniele
    Donno, Alfredo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [24] Heavy cycles and spanning trees with few leaves in weighted graphs
    Li, Binlong
    Zhang, Shenggui
    APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 908 - 910
  • [25] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
    Yue Liu
    Jing Huang
    Graphs and Combinatorics, 2009, 25 : 753 - 758
  • [26] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
    Liu, Yue
    Huang, Jing
    GRAPHS AND COMBINATORICS, 2009, 25 (05) : 753 - 758
  • [27] Optimal path and minimal spanning trees in random weighted networks
    Braunstein, Lidia A.
    Wu, Zhenhua
    Chen, Yiping
    Buldyrev, Sergey V.
    Kalisky, Tomer
    Sreenivasan, Sameet
    Cohen, Reuven
    Lopez, Eduardo
    Havlin, Shlomo
    Stanley, H. Eugene
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2007, 17 (07): : 2215 - 2255
  • [28] Rainbow spanning trees in random subgraphs of dense regular graphs
    Bradshaw, Peter
    DISCRETE MATHEMATICS, 2024, 347 (06)
  • [29] Spanning trees from the commute times of random walks on graphs
    Qiu, Huaijun
    Hancock, Edwin R.
    IMAGE ANALYSIS AND RECOGNITION, PT 2, 2006, 4142 : 375 - 385
  • [30] Random spanning trees of Cayley graphs and an associated compactification of semigroups
    Evans, SN
    PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 1999, 42 : 611 - 620