Multilevel Partitioning for Matrx Reordering
While performing multi-level partitioning is there a way to get the information about the relationships between parent and child partitions.
If I have a Graph G partitions it into 2 sub graphs G1 and G2. Then G1 to subgraphs G11, G12. Similarly G2 to G21 and G22. When arranged these become a complete binary tree. Is there a way of obtaining these information using metis or hmetis. In some cases of matrix re-arrangement I need to store the relationships between parent graphs and their sub-graphs (or at least this hierarchy for retrieving the appropriate partition/subgraph which matches a condition). Is there a way to get this information from metis or hmetis?