"Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes."

Antoine Bossard, Keiichi Kaneko (2014)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2021-07-16

- view
  - electronic edition @ sinica.edu.tw (archived)
- export record
  dblp key:
  - journals/jise/BossardK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jise/BossardK14
Antoine Bossard, Keiichi Kaneko:
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng. 30(4): 1087-1093 (2014)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.