Result 1 to 20 of 127 total
On deriving conditional diagnosability of interconnection networks. (English)
Inf. Process. Lett. 112, No. 17-18, 674-677 (2012).
1
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. (English)
Discrete Math. 312, No. 21, 3087-3095 (2012).
2
Bounded length, 2-edge augmentation of geometric planar graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250036,19p. (2012).
3
Fault tolerance of edge pancyclicity in alternating group graphs. (English)
Appl. Math. Comput. 218, No. 19, 9875-9881 (2012).
4
Extraconnectivity of $k$-ary $n$-cube networks. (English)
Theor. Comput. Sci. 443, 63-69 (2012).
5
A self-stabilizing algorithm to maximal 2-packing with improved complexity. (English)
Inf. Process. Lett. 112, No. 13, 525-531 (2012).
6
Möbius-deBruijn: the product of Möbius cube and deBruijn digraph. (English)
Inf. Process. Lett. 112, No. 5, 205-211 (2012).
7
Edge fault tolerance of graphs with respect to super edge connectivity. (English)
Discrete Appl. Math. 160, No. 4-5, 579-587 (2012).
8
Faster swap edge computation in minimum diameter spanning trees. (English)
Algorithmica 62, No. 1-2, 169-191 (2012).
9
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. (English)
Int. J. Comput. Math. 88, No. 13, 2669-2684 (2011).
10
A sufficient condition for boundedness of tolerance graphs. (English)
Discrete Appl. Math. 159, No. 17, 2165-2169 (2011).
11
Disjoint path covers in recursive circulants $G(2^m,4)$ with faulty elements. (English)
Theor. Comput. Sci. 412, No. 35, 4636-4649 (2011).
12
Fault-tolerant embedding of meshes/tori in twisted cubes. (English)
Int. J. Comput. Math. 88, No. 8, 1595-1602 (2011).
13
First-fit coloring of bounded tolerance graphs. (English)
Discrete Appl. Math. 159, No. 7, 605-611 (2011).
14
Fault tolerance of vertex pancyclicity in alternating group graphs. (English)
Appl. Math. Comput. 217, No. 16, 6785-6791 (2011).
15
Embedding meshes/tori in faulty crossed cubes. (English)
Inf. Process. Lett. 110, No. 14-15, 559-564 (2010).
16
A new parameter for a broadcast algorithm with locally bounded Byzantine faults. (English)
Inf. Process. Lett. 110, No. 12-13, 514-517 (2010).
17
Fault diameters of graph products and bundles. (English)
Mastorakis, N. (ed.) et al., Latest trends on computers. 2 Volumes. Papers based on the presentations at the 14th WSEAS international conference on computers (Part of the 14th WSEAS CSCC multiconference), Corfu Island, Greece, July 23‒25, 2010. Athens: World Scientific and Engineering Academy and Society (WSEAS) (ISBN 978-960-474-206-6/CD-ROM; 978-960-474-201-1). 642-651 (2010).
18
Computing graph spanners in small memory: fault-tolerance and streaming. (English)
Discrete Math. Algorithms Appl. 2, No. 4, 591-605 (2010).
19
Ring embedding in faulty generalized honeycomb torus ‒ GHT$(m, n, n/2)$. (English)
Int. J. Comput. Math. 87, No. 15, 3344-3358 (2010).
20
Result 1 to 20 of 127 total
Start
Contact
Print
General Help
