given a graph that is a tree, find an edge that, if cut, divides the tree into as equal sized pair of pieces as possible. (there may be multiple possible such cuts; choose one.) repeat for the subtrees.
motivation is to place some helpful landmarks (entrances to "regions") in a tree-like maze. do the first few layers of landmarks end up all being near each other?
No comments :
Post a Comment