Hierarchical Max-Flow Routing
metanode routing is computed using the graph Gmeta and is a straightforward application of max-ﬂow routing. Speciﬁcally, for each metanode source and destination, a max-ﬂow problem is solved on Gmeta with the capacity of each meta-link deﬁned as above. Once the inter-metanode routing is known, the intra-metanode routing can be computed.
DA: 3 PA: 87 MOZ Rank: 46