DETERMINATION OF COMPONENTS OF A GRAPH AND THEIR SHORTEST SPANNING TREE

被引：0
|
作者：
MUHLBACHER, J
机构：
来源：
ANGEWANDTE INFORMATIK | 1972年 / 01期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：40 / +
页数：1
相关论文
共 50 条
  • [11] Establishment of the Shortest Spanning Tree of Assembly Dimensions and Its Application
    Wang Y.
    Wang X.
    Zhang X.
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2018, 54 (05): : 220 - 227
  • [12] Finding the Shortest Bottleneck Edge in a Parametric Minimum Spanning Tree
    Chan, Timothy M.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 917 - 918
  • [13] The connectivity of the leaf-exchange spanning tree graph of a graph
    Broersma, HJ
    Li, XL
    ARS COMBINATORIA, 1996, 43 : 225 - 231
  • [14] THE MINIMUM SPANNING TREE PROBLEM ON A PLANAR GRAPH
    MATSUI, T
    DISCRETE APPLIED MATHEMATICS, 1995, 58 (01) : 91 - 94
  • [15] A note on a spanning (α, β)-ended tree in a bipartite graph
    Tsugaki, Masao
    GRAPHS AND COMBINATORICS, 2018, 34 (04) : 693 - 701
  • [16] On the spanning tree packing number of a graph: a survey
    Palmer, EM
    DISCRETE MATHEMATICS, 2001, 230 (1-3) : 13 - 21
  • [17] On a spanning tree with specified leaves in a bipartite graph
    Tsugaki, Masao
    Yamashita, Tomoki
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2020, 77 : 69 - 86
  • [18] Navigating in a Graph by Aid of Its Spanning Tree
    Dragani, Feodor F.
    Matamala, Martin
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 788 - +
  • [19] DETERMINATION OF LENGTH OF SHORTEST PATH IN A GRAPH
    LITVAK, YI
    ZAVARIN, AN
    ENGINEERING CYBERNETICS, 1974, 12 (04): : 29 - 32
  • [20] SPANNING TREE METHODS FOR SAMPLING GRAPH PARTITIONS
    Claremont McKenna College, Claremont
    CA, United States
    不详
    MA, United States
    不详
    GA, United States
    arXiv,
12345