
168
References
[14] G. Karypis and V. Kumar. A parallel algorithm for multilevel graph partitioning
and sparse matrix ordering. Journal of Parallel and Distributed Computing,
48:71-95, 1998.
[15] G. Karypis and V. Kumar. A fast and high quality multilevel scheme for parti-
tioning irregular graphs. SIAM J. on Scientific Computing, 20(1):359-392,1999.
[16] B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning
graphs, The Bell System Technical Journal, 49(2):291-307, 1970.
[17] G. Liu and L. Wong. Effective pruning techniques for mining quasi-cliques. W.
Daelemans, B. Goethals, and K. Morik, Eds., Springer LNAI, ECML/PKDD,
5212:3 ...