Construction of vertex-disjoint paths in alternating group networks

Author： Zhou Shuming Xiao Wenjun Parhami Behrooz

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.54, Iss.2, 2010-11, pp. : 206-228

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Communication in the two-way listen-in vertex-disjoint paths mode

By Bockenhauer H.-J.

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 65-90

Elsevier

Access to resources Recommend Favorite

Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks

By Zhang Kejia

International Journal of Sensor Networks, Vol. 13, Iss. 3, 2013-06 ,pp. : 173-184

Inderscience Publishers

Access to resources Recommend Favorite

End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks

By Ling Hui Znati Taieb

International Journal of Security and Networks, Vol. 2, Iss. 1-2, 2007-03 ,pp. : 109-121

Inderscience Publishers

Access to resources Recommend Favorite

On Finding Min-Min Disjoint Paths

By Guo Longkun

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 641-653

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S. Ghosh R.K. Reddy A.P.K.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite