<s>
The	O
Kernighan	B-Algorithm
–	I-Algorithm
Lin	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
heuristic	B-Algorithm
algorithm	I-Algorithm
for	O
finding	O
partitions	O
of	O
graphs	O
.	O
</s>
<s>
The	O
algorithm	O
maintains	O
and	O
improves	O
a	O
partition	O
,	O
in	O
each	O
pass	O
using	O
a	O
greedy	B-Algorithm
algorithm	I-Algorithm
to	O
pair	O
up	O
vertices	O
of	O
with	O
vertices	O
of	O
,	O
so	O
that	O
moving	O
the	O
paired	O
vertices	O
from	O
one	O
side	O
of	O
the	O
partition	O
to	O
the	O
other	O
will	O
improve	O
the	O
partition	O
.	O
</s>
