Hierarchical partitioning Log Out | Topics | Search
Moderators | Edit Profile

Discussion about George's Research » METIS - Serial Graph Partitioning » General Usage Questions » Hierarchical partitioning « Previous Next »

Author Message
Top of pagePrevious messageNext messageBottom of page Link to this message

Anonymous
Posted From: 194.95.184.175
Posted on Thursday, January 29, 2004 - 02:40 pm:   

Hallo dear developers!
Say me please is it possible?
If I right understand METIS can devide graph on k subgraphs. But I need hierachical devision.
On first level I need 2 subgraphs,
on the second level 4 (recursively devide each subgraph from level 1 on two subgraphs) and so on.
I want to have something like binary tree.
And in output file I would like to see to which subgraphs belongs each point. Each point belongs to H subgraphs, where H is high of the tree.
Is it possible?

Thank you very much for such great programm.

Add Your Message Here
Posting is currently disabled in this topic. Contact your discussion moderator for more information.

Topics | Last Day | Last Week | Tree View | Search | Help/Instructions | Program Credits Administration