Efficient identification of Web communities
- 1 August 2000
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 150-160
- https://doi.org/10.1145/347090.347121
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Accessibility of information on the webNature, 1999
- Inferring Web communities from link topologyPublished by Association for Computing Machinery (ACM) ,1998
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentationIeee Transactions On Pattern Analysis and Machine Intelligence, 1993
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local OptimalityIeee Transactions On Pattern Analysis and Machine Intelligence, 1984
- Co‐citation in the scientific literature: A new measure of the relationship between two documentsJournal of the American Society for Information Science, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Bibliographic coupling between scientific papersAmerican Documentation, 1963
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956