مرکز منطقه ای اطلاع رساني علوم و فناوري - An efficient algorithm for k-pairwise disjoint paths in star graphs

Title of article :

An efficient algorithm for k-pairwise disjoint paths in star graphs

Author/Authors :

Qian-Ping Gu، نويسنده , , Shietung Peng، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1998

Pages :

From page :

283

To page :

287

Keywords :

Disjoint paths , Interconnection networks , Off-line routing algorithm

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128952

Link To Document :