On the total k -diameter of connection networks

Author： Dinitz  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.247, Iss.1, 2000-09, pp. : 213-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

Connection law and networks

By Ito Takao  

Artificial Life and Robotics, Vol. 15, Iss. 3, 2010-09 ,pp. : 275-278

Springer Publishing Company

Access to resources Recommend Favorite

The K -Connection Location Problem in a Plane

By Huang Simin   Batta Rajan   Klamroth Kathrin   Nagi Rakesh  

Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. : 193-209

Springer Publishing Company

Access to resources Recommend Favorite

Conditional Fault Diameter of Star Graph Networks

By Rouskov Y.   Latifi S.   Srimani P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 1, 1996-02 ,pp. : 91-97

Academic Press

Access to resources Recommend Favorite

Exact Solutions to Diameter and Routing Problems in PEC Networks

By Raghavendra C.S.   Sridhar M.A.  

Journal of Parallel and Distributed Computing, Vol. 34, Iss. 2, 1996-05 ,pp. : 202-210

Academic Press

Access to resources Recommend Favorite

Packet Routing in Fixed-Connection Networks: A Survey

By Grammatikakis M.D.   Hsu D.F.   Kraetzl M.   Sibeyn J.F.  

Journal of Parallel and Distributed Computing, Vol. 54, Iss. 2, 1998-11 ,pp. : 77-132

Academic Press

Access to resources Recommend Favorite