Question about the initial partitioning of kmetis
Hello,
I am trying to find out exactly what algorithm is used for the initial
partitioning in kmetis.
Is it spectral bisection, the Kernighan-Lin algorithm, the graph
growing algorithm of the greedy graph growing algorithm?
If anybody knows the answer i would be obliged to know it,
thank you,
Maria
Submitted by maria on Wed, 2007-08-15 16:15
»
- Login to post comments