Question about the initial partitioning of kmetis


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,