An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs-Reference-Cited by-同舟云学术

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs

Author:

HONMA Hirotoshi¹,HONMA Saki²,MASUYAMA Shigeru³

Affiliation:

1. Department of Information Engineering, Kushiro National College of Technology

2. Electronic Information System Engineering Course, Kushiro National College of Technology

3. Department of Knowledge-Based Information Engineering, Toyohashi University of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

Reference18 articles.

1. [1] R.J. Wilson, Introduction to Graph Theory, Prentice Hall, 1996.

3. [3] R.C. Prim, “Shortest connection network and some generalizations, ” Bell Syst. Tech. J., vol.36, pp.1389-1401, 1957.

4. [4] C. Berge and A.G. Houri, Programming, Games and Trasportation Networks, John Wiley, New York, 1965.

5. [5] A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2013