Node-to-Set Disjoint Paths Problem in a Mobius Cube

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F16%3A00338688" target="_blank" >RIV/68407700:21240/16:00338688 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1587/transinf.2015EDP7331" target="_blank" >https://doi.org/10.1587/transinf.2015EDP7331</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1587/transinf.2015EDP7331" target="_blank" >10.1587/transinf.2015EDP7331</a>

Result language
angličtina
Original language name
Node-to-Set Disjoint Paths Problem in a Mobius Cube
Original language description
This paper proposes an algorithm that solves the node-to-set disjoint paths problem in an n-Mobius cube in polynomial-order time of n. It also gives a proof of correctness of the algorithm as well as estimating the time complexity, O(n(4)), and the maximum path length, 2n - 1. A computer experiment is conducted for n = 1, 2, ... , 31 to measure the average performance of the algorithm. The results show that the average time complexity is gradually approaching to O(n(3)) and that the maximum path lengths cannot be attained easily over the range of n in the experiment.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - 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
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)