Contiguous partitions

Hi,
I need a partitioning algorithm that partitions a graph into *contiguous* partitions of approximately equal size.

I read that METIS does not guaranteee the partitions to be contiguous. Could I use hMETIS instead?

Otherwise, can anyone point me to an algorithm that satisfies both conditions. A pointer to author/paper would be great!

Thanks!

Jay

RE: Jay, I'm working on the next

Jay,

I'm working on the next release of Metis (I know it has been a while), which will have an option to enforce contiguous partitions. I should have something with a week or two.

george

RE: George, is this option

George,
is this option available now?
Per