Author: Halperin S. Zwick U.
Publisher: Academic Press
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.39, Iss.1, 2001-04, pp. : 1-46
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
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. :
Finding 2-edge connected spanning subgraphs
By Huh W.T.
Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. :
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. :