A grid embedding into the star graph for image analysis solutions

Information Processing Letters

Volumn 60, Issue 5, 1996, Pages 255-260

  Nassif, Nayla ^a   Bagherzadeh, Nader ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Grid embedding; Image analysis; Interconnection networks; Massively parallel; Parallel algorithms; Parallel processing; Star interconnection network

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; GRAPH THEORY; IMAGE ANALYSIS; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

GRID EMBEDDING; STAR GRAPH; STAR INTERCONNECTION NETWORK; TWO DIMENSIONAL GRID;

COMPUTER NETWORKS;

EID: 0030577345     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00165-2     Document Type: Article

References (10)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. S.B. Akers, D. Harel and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. Internat. Conf. on Parallel Processing (1987) 393-400.
3. S.B. Akers and B. Krishnamurthy, The fault tolerance of star graphs, in: Proc. 2nd Internat. Conf. on Supercomputing (1987) 270-276.
4. N. Bagherzadeh, N. Nassif and S. Latifi, A routing and broadcasting scheme on faulty star graphs, IEEE Trans. Comput. 42 (11) (1993) 1398-1402.
5. S. Latifi and N. Bagherzadeh, Hamiltonicity of the clustered-star graph with embedding applications, in: Proc: Internat. Conf. on Parallel and Distributed Processing Techniques and Applications, Sunnyvale, CA (1996) 734-744.
6. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees. Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992).
7. A. Menn and A.K. Somani, An efficient sorting algorithm for the star graph interconnection network, in: Proc. Internat. Conf. on Parallel Processing, Vol. III (1990) 1-8.
8. N. Nassif, A study of star graph algorithms, Ph.D. Dissertation, University of California at Irvine, 1996.
9. M. Nigam, S. Sahni and B. Krishnamurthy, Embedding Hamiltonians and hypercubes in star interconnection networks, in: Proc. Internat. Conf. on Parallel Processing (1990) 340-343.
10. S. Ranka, J.-C. Wang and N. Yeh, Embedding meshes on the star graph, J. Parallel Distributed Comput. 19 (2) (1993) 131-135.