Author： Karypis G. Kumar V.
Publisher： Academic Press
ISSN： 0743-7315
Source： Journal of Parallel and Distributed Computing, Vol.48, Iss.1, 1998-01, pp. : 96-129
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the k-path partition of graphs
By Steiner G.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Partitioning vertices of 1-tough graphs into paths
By Bazgan C. Harkat-Benhamdine A. Li H. Wozniak M.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Dynamic Multi-level Overlay Graphs for Shortest Paths
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :