Connectivity of random geometric graphs related to minimal spanning forests

被引：0
|
作者：
机构：
[1] Hirsch, C.
[2] Neuhäuser, D.
[3] Schmidt, V.
来源：
| 1600年 / Applied Probability Trust卷 / 45期
关键词：
Musculoskeletal system - Chains;
D O I：
10.1239/aap/1363354101
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Spanning trees in random graphs
    Montgomery, Richard
    ADVANCES IN MATHEMATICS, 2019, 356
  • [32] Spanning subgraphs of random graphs
    Riordan, O
    COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (02): : 125 - 148
  • [33] Induced graphs of uniform spanning forests
    Lyons, Russell
    Peres, Yuval
    Sun, Xin
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2020, 56 (04): : 2732 - 2744
  • [34] The Super Spanning Connectivity of Arrangement Graphs
    Li, Pingshan
    Xu, Min
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (08) : 1047 - 1072
  • [35] On the spanning fan-connectivity of graphs
    Lin, Cheng-Kuan
    Tan, Jimmy J. M.
    Hsu, D. Frank
    Hsu, Lih-Hsing
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1342 - 1348
  • [36] The expected degree of minimal spanning forests
    Andreas Thom
    Combinatorica, 2016, 36 : 591 - 600
  • [37] Ends in free minimal spanning forests
    Timar, Adam
    ANNALS OF PROBABILITY, 2006, 34 (03): : 865 - 878
  • [38] The Spanning Connectivity of the Burnt Pancake Graphs
    Chin, Cherng
    Weng, Tien-Hsiung
    Hsu, Lih-Hsing
    Chiou, Shang-Chia
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (03) : 389 - 400
  • [39] The expected degree of minimal spanning forests
    Thom, Andreas
    COMBINATORICA, 2016, 36 (05) : 591 - 600
  • [40] Spanning Trees in Multipartite Geometric Graphs
    Ahmad Biniaz
    Prosenjit Bose
    David Eppstein
    Anil Maheshwari
    Pat Morin
    Michiel Smid
    Algorithmica, 2018, 80 : 3177 - 3191
12345