SPANNING TREE METHODS FOR SAMPLING GRAPH PARTITIONS

被引：0
|
作者：
Claremont McKenna College, Claremont [1 ]
CA, United States
不详 [2 ]
MA, United States
不详 [3 ]
GA, United States
机构：
来源：
arXiv |
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Benchmarking
引用
收藏
相关论文
共 50 条
  • [1] FINDING SHORTEST SPANNING TREE OF A GRAPH BY PROGRAMMABLE METHODS
    FIETZ, TR
    [J]. GEOGRAPHICAL ANALYSIS, 1976, 8 (02) : 201 - 204
  • [2] Methods of Constructing and Enumerating the Spanning Tree of a Connected Graph
    Xu, Zhaodi
    Li, Xiaoyi
    Chou, Wanxi
    [J]. FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE IV, PTS 1-5, 2014, 496-500 : 2363 - +
  • [3] Equitable partitions into spanning trees in a graph
    Fekete, Zsolt
    Szabo, Jacint
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [4] Spanning tree of a multiple graph
    Smirnov, Alexander V.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (04) : 850 - 869
  • [5] Spanning tree of a multiple graph
    Alexander V. Smirnov
    [J]. Journal of Combinatorial Optimization, 2022, 43 : 850 - 869
  • [6] FINDING SHORTEST SPANNING TREE OF AN INCOMPLETE CONNECTED GRAPH BY MANUAL METHODS
    FIETZ, TR
    [J]. GEOGRAPHICAL ANALYSIS, 1975, 7 (03) : 311 - 314
  • [7] CENTERING A SPANNING TREE OF A BICONNECTED GRAPH
    CHESTON, GA
    FARLEY, A
    HEDETNIEMI, ST
    PROSKUROWSKI, A
    [J]. INFORMATION PROCESSING LETTERS, 1989, 32 (05) : 247 - 250
  • [8] The Spanning Tree of a Divisible Multiple Graph
    Smirnov, A. V.
    [J]. AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2018, 52 (07) : 871 - 879
  • [9] Empirical sampling of connected graph partitions for redistricting
    Najt, Elle
    DeFord, Daryl
    Solomon, Justin
    [J]. PHYSICAL REVIEW E, 2021, 104 (06)
  • [10] The connectivity of the leaf-exchange spanning tree graph of a graph
    Broersma, HJ
    Li, XL
    [J]. ARS COMBINATORIA, 1996, 43 : 225 - 231
12345