Node-to-Node Disjoint Paths Problem in Mobius Cubes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00328889" target="_blank" >RIV/68407700:21240/17:00328889 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1587/transinf.2016EDP7475" target="_blank" >http://dx.doi.org/10.1587/transinf.2016EDP7475</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1587/transinf.2016EDP7475" target="_blank" >10.1587/transinf.2016EDP7475</a>

Result language

angličtina

Original language name

Node-to-Node Disjoint Paths Problem in Mobius Cubes

Original language description

The Mobius cube is a variant of the hypercube. Its advantage is that it can connect the same number of nodes as a hypercube but with almost half the diameter of the hypercube. We propose an algorithm to solve the node-to-node disjoint paths problem in n-Mobius cubes in polynomial-order time of n. We provide a proof of correctness of the algorithm and estimate that the time complexity is O(n(2)) and the maximum path length is 3n - 5.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEICE Transactions on Information and Systems

ISSN

0916-8532

e-ISSN

1745-1361

Volume of the periodical

E100D

Issue of the periodical within the volume

8

Country of publishing house

JP - JAPAN

Number of pages

7

Pages from-to

1837-1843

UT code for WoS article

000406868400032

EID of the result in the Scopus database

—