1 / 1

I/O-efficient Hierarchical Diameter Approximation

Deepak Ajwani Bell Labs, Ireland. Ulrich Meyer Goethe University. David Veith Goethe University. I/O-efficient Hierarchical Diameter Approximation. For the hierarchical diameter approximation we have developed several heuristics to improve the result:

chico
Download Presentation

I/O-efficient Hierarchical Diameter Approximation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Deepak AjwaniBell Labs, Ireland Ulrich MeyerGoethe University David VeithGoethe University I/O-efficient Hierarchical Diameter Approximation • For the hierarchical diameter approximation we have developed several heuristics to improve the result: • Break ties that the path length is kept small in the shrunken graph • Move masters to the cluster centre to counterbalance weights • Results 12 12 2 10 2 10 6 14 3 3 1 1 Without TIE breaking The master is in the centre of its cluster. So, we achieve counterbalanced distances to all adjacent clusters. The master is at the border of its cluster. Yes Compute IM-SSSP Approximated Diameter Shrink Graph Fits into M? No store edges/ weights in two files Preprocessing with EM-BFS Phase I Semi-external SSSP M M M MADALGO – Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation

More Related