On maximally distant spanning trees of a graph
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[2] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .
[3] Y. Kajitani,et al. Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .
[4] H. Watanabe,et al. Topological degrees of freedom and mixed analysis of electrical networks , 1970 .
[5] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .
[6] Tiko Kameda,et al. Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) , 1973, SWAT.
[7] C. Nash-Williams. Decomposition of Finite Graphs Into Forests , 1964 .
[8] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[9] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[10] R. K. Hanst,et al. Velocity Modulation System for Enhancement of 50 Picosecond Radiation Pulse , 1969 .
[11] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[12] Stephen M. Chase,et al. An implemented graph algorithm for winning Shannon Switching Games , 1972, CACM.