Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 2000: Advances in Computing Science — ASIAN 2000 pp 119–132Cite as

Node-to-Set Disjoint Paths Problem in Rotator Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1961))

Abstract

In this paper, we give an algorithmfor the node-to-set disjoint paths problemi n rotator graphs. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The proof of correctness of our algorithm, the sum of the length of paths, and the time complexity are also given.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akers, S. B. and Krishnamurthy, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. Comp. 38 (1989) 555–566

    Article  MATH  MathSciNet  Google Scholar 

  2. Bao, F., et al.: Reliable broadcasting and secure distributing in channel networks. IEICE Trans. Fundamentals E81-A (1998) 796–806

    Google Scholar 

  3. Corbett, P. F.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel and Distributed Systems 3 (1992) 622–626

    Article  Google Scholar 

  4. Dandamudi, S. P. and Eager, D. L.: Hierarchical interconnection networks for multicomputer systems. IEEE Trans. Comp. 39 (1990) 786–797

    Article  Google Scholar 

  5. Ghose, K. and Desai, K. R.: Hierarchical cubic networks. IEEE Trans. Parallel and Distributed Systems 6(1995) 427–435

    Article  Google Scholar 

  6. Gu, Q.-P. and Peng, S.: Node-to-set disjoint paths problemin star graphs. Information Processing Letters 62(1997) 201–207

    Article  MathSciNet  Google Scholar 

  7. Hamada, Y., et al.: Nonadaptive fault-tolerant file transmission in rotator graphs. IEICE Trans. Fundamentals E79-A (1996) 477–482

    Google Scholar 

  8. Hwang, K. and Ghosh, J.: Hypernet — A communication-efficient architecture for constructing massively parallel computers. IEEE. Trans. Comp. C-36 (1987) 1450–1466

    Article  Google Scholar 

  9. Malluhi, Q. M. and Bayoumi, M. A.: The hierarchical hypercube — A new interconnection topology for massively parallel systems. IEEE Trans. Parallel and Distributed Systems 5 (1994) 17–30

    Article  MathSciNet  Google Scholar 

  10. Preparata, F. P. and Vuillemin, J.: The cube-connected cycles — A versatile network for parallel computation. CACM 24 (1981), 300–309

    MathSciNet  Google Scholar 

  11. Rabin, M. O.: Efficient dispersal of information for security, load balancing, and fault tolerance. JACM 36 (1989), 335–348

    Article  MATH  MathSciNet  Google Scholar 

  12. Wan, P.-J.: Conflict-free channel set assignment for an optical cluster interconnection network based on rotator digraphs. Theoretical Computer Science 207 (1998) 193–201

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo University of Agriculture and Technology, 184-8588, Tokyo, Japan

    Keiichi Kaneko & Yasuto Suzuki

Authors
  1. Keiichi Kaneko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuto Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute for Software Technology, United Nations University, Casa Silva Mendes,Estrada do Engenheiro Trigo NO 4, Macau, China

    He Jifeng

  2. Graduate School of Informatics, Kyoto University, 606-8501, Kyoto, Sakyo-ku, Japan

    Masahiko Sato

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaneko, K., Suzuki, Y. (2000). Node-to-Set Disjoint Paths Problem in Rotator Graphs. In: Jifeng, H., Sato, M. (eds) Advances in Computing Science — ASIAN 2000. ASIAN 2000. Lecture Notes in Computer Science, vol 1961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44464-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44464-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41428-5

  • Online ISBN: 978-3-540-44464-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation