Many-to-many two-disjoint path covers in restricted hypercube-like graphs

The crossed cube architecture for parallel computation

Kemal Efe · IEEE Transactions on Parallel and Distributed Systems · 1992 · 452 citations

Computing, Computer Engineering, Computer Science +17

A variation on the hypercube with lower diameter

Kemal Efe · IEEE Transactions on Computers · 1991 · 306 citations

Computing, Computer Engineering, Computer Science +17

Algorithmic graph theory

Choice Reviews Online · 1990 · 164 citations

Computing, Computer Science, Mathematics +10

On Path Cover Problems in Digraphs and Applications to Program Testing

Simeon Ntafos, S. L. Hakimi · IEEE Transactions on Software Engineering · 1979 · 163 citations

Computing, Computer Science, Mathematics +8

Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements

Jung-Heum Park, Hee‐Chul Kim, Hyeong-Seok Lim · IEEE Transactions on Parallel and Distributed Systems · 2006 · 120 citations

Computing, Computer Engineering, Computer Science +10