Centroid decomposition is a divide and conquer approach which helps in making distance queries on large trees in an efficient way. \\ For example, using centroid decomposition on tree(n vertices), we can find the number of nodes at distance of x from vertex v in O(log^2^ n) time and O(n log (n)) memory. Due to low memory requirements, it can be used on large graphs.\\ I wish to submit a patch on this if idea is fine and nothing of this sort is implemented till now. Currently, I am not able to find any paper explaining algorithms, though there are some blogs which describe this approach. If anyone wishes, I can link some blogs regarding the technique or write it myself.
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
