Long paths in hypercubes with a quadratic number of faults

Information Sciences

Volumn 179, Issue 21, 2009, Pages 3763-3771

  Dvořák, Tomáš ^a   Koubek, Václav ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Faulty vertex; Hypercube; Linear time algorithm; Long path

Indexed keywords

ASYMPTOTICALLY OPTIMAL; FAULTY VERTEX; FAULTY VERTICES; FREE PATH; HYPER-CUBES; HYPERCUBE; LINEAR TIME; LINEAR-TIME ALGORITHM; LONG PATH; POLYNOMIAL-TIME; QUADRATIC NUMBER;

CLUSTERING ALGORITHMS; POLYNOMIAL APPROXIMATION;

GEOMETRY;

EID: 68349130361     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.06.029     Document Type: Article

References (13)

1. Sergei L. Bezrukov, Isoperimetric problems in discrete spaces, in: P. Frankl, Z. Füredi, G. Katona, D. Miklós (Eds.), Extremal problems for finite sets, Bolyai Society Mathematical Studies, Budapest, vol. 3, 1994, pp. 59-91.
2. Dvořák T., and Gregor P. Partitions of faulty hypercubes into paths with prescribed endvertices. SIAM Journal on Discrete Mathematics 22 4 (2008) 1448-1461
3. Fink J., and Gregor P. Long paths and cycles in hypercubes with faulty vertices. Information Sciences 179 (2009) 3634-3644
4. Fu J.-S. Longest fault-free paths in hypercubes with vertex faults. Information Sciences 176 7 (2006) 759-771
5. Havel I. On hamiltonian circuits and spanning trees of hypercubes. Časopis Pro Pěstování Matematiky 109 (1984) 135-152
6. Jungnickel D. Graphs Networks and Algorithms (Algorithms and Computation in Mathematics) (2004), Springer-Verlag, New York
7. Knuth D.E. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (2005), Addison-Wesley Professional
8. Kueng T.-L., Liang T., Hsu L.-H., and Tan J.J.M. Long paths in hypercubes with conditional node-faults. Information Sciences 179 5 (2009) 667-681
9. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes (1992), Morgan Kaufmann, San Mateo, CA
10. Lewinter M., and Widulski W. Hyper-hamilton laceable and caterpillar-spannable product graphs. Computers and Mathematics with Applications 34 (1997) 99-104
11. Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu, Compressing bitmap indices by data reorganization, in: ICDE'05: Proceedings of the 21st International Conference on Data Engineering, IEEE Computer Society, 2005, pp. 310-321.
12. Richards D.S. Data compression and Gray-code sorting. Information Processing Letters 22 4 (1986) 201-205
13. Wiener G. Edge multiplicity and other trace functions. Electronic Notes in Discrete Mathematics 29 (2007) 491-495