Author： Lu B.-K. Hsu F.-R. Tang C.Y.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 113-121
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
Finding the most vital node of a shortest path
By Nardelli E. Proietti G. Widmayer P.
Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. :
Access to resources
Recommend
A necessary condition for a graph to be the visibility graph of a simple polygon
By Chen C.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
By Cheng S.-W.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Finding a shortest vector in a two-dimensional lattice modulo m
By Rote G.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :