论文信息 - Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) - 字舞流文

Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)

Tiko Kameda | S. Toida

[1] Y. Kajitani,et al. Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .

[2] H. Watanabe,et al. Topological degrees of freedom and mixed analysis of electrical networks , 1970 .

[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[4] Jeffrey D. Ullman,et al. Set Merging Algorithms , 1973, SIAM J. Comput..

[5] Stephen M. Chase,et al. An implemented graph algorithm for winning Shannon Switching Games , 1972, CACM.

[6] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .