Author： Steiner D.
Publisher： Springer Publishing Company
ISSN： 0178-2789
Source： The Visual Computer, Vol.20, Iss.4, 2004-06, pp. : 266-278
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
Parallel Algorithms and Applications, Vol. 17, Iss. 3, 2001-01 ,pp. :
Access to resources
Recommend
Finding houses and holes in graphs
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
On finding common neighborhoods in massive graphs
By Buchsbaum A.L. Giancarlo R. Westbrook J.R.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Finding the Parts of Objects in Range Images
Computer Vision and Image Understanding, Vol. 64, Iss. 2, 1996-09 ,pp. :
Constructing the highest degree subgraph for dense graphs is in NCAS
By Andreev A.E. Clementi A.E.F. Rolim J.D.P.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :