A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Computing betweenness centrality in external memory
2013
2013 IEEE International Conference on Big Data
Preserved Fulltext
In this paper we describe the first known external-memory and cache-oblivious algorithms for computing betweenness centrality. ...
We describe general algorithms for networks with weighted and unweighted edges and a specialized algorithm for networks with small diameters, as is common in social networks exhibiting the "small worlds ...
Our algorithm builds on the all-pairs shortest-paths algorithms of Chowdhury and Ramachandran [20] and of Arge et al. ...
doi:10.1109/bigdata.2013.6691597
dblp:conf/bigdataconf/ArgeGW13
fatcat:smhxlmehargiliaraljh5b5lq4
I/O-efficient approximation of graph diameters by parallel cluster growing — a first experimental study
2012
PARS Parallel-Algorithmen -Rechnerstrukturen und -Systemsoftware
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
[9] who gave an O(n 2 ) algorithm for computing all-pair shortest path with high probability is infeasible for such graphs.
A. ...
Exact computation of the diameter on unweighted undirected graphs (via All-Pairs Shortest-Paths, APSP) has been addressed in [16] , [17] : both approaches require Θ(n · sort(n)) I/Os for sparse graphs ...
doi:10.1007/bf03342028
fatcat:evtjou6zyzhwrg24hrn4w45vcy
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy
2018
Innovations in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We create conjectures that the current best known algorithms for Single Source Shortest Paths (SSSP), diameter, and radius are optimal. ...
Using fine-grained reductions, we give an algorithm for distinguishing 2 vs. 3 diameter and radius that runs in O(|E| 2 /(M B)) cache misses, which for sparse graphs improves over the previous O(|V | 2 ...
We thank the anonymous reviewers for their helpful suggestions. ...
doi:10.4230/lipics.itcs.2018.34
dblp:conf/innovations/DemaineLLLW18
fatcat:dwdccig625e2zfrm6yxrxrnor4
I/O-Efficient Shortest Path Queries in Geometric Spanners
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Research supported by NSERC and NCE GEOIDE. well-separated pair decomposition (WSPD), and [17] for external memory models and algorithms. ...
In external memory, sparseness is not sufficient to obtain I/O-efficient algorithms, as the best known single source shortest path algorithm takes . ...
Planarity is desirable, as planar graphs can be blocked [1] , and an I/O-efficient single source shortest path algorithm for embedded planar graphs is known [3] . ...
doi:10.1007/3-540-44634-6_27
fatcat:rivt65ygm5bdpfkqdmgoncv36a
I/O-efficient Hierarchical Diameter Approximation
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements The authors would like to thank Andreas Beckmann for his help with STXXL and the hardware resources and the anonymous reviewers for their feedback. ...
Related Work The traditional approaches for computing the exact diameter rely on computationally expensive primitives such as solving the all pair shortest path problem (APSP) or fast matrix multiplication ...
In the external memory, network analysis algorithms have been developed for specific graph classes (e.g., [14] for naturally sparse graphs). ...
doi:10.1007/978-3-642-33090-2_8
fatcat:bocwwsbfarhezof2aykqhroyyu
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We create conjectures that the current best known algorithms for Single Source Shortest Paths (SSSP), diameter, and radius are optimal. ...
Using fine-grained reductions, we give an algorithm for distinguishing 2 vs. 3 diameter and radius that runs in O(|E|^2/(MB)) cache misses, which for sparse graphs improves over the previous O(|V|^2/B) ...
Acknowledgements We thank the anonymous reviewers for their helpful suggestions. ...
arXiv:1711.07960v3
fatcat:i7sgttq64rfclpnoibguqiqduy
An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
[chapter]
2007
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our implementation exhibits remarkable parallel speedup when compared with competitive sequential algorithms, for low-diameter sparse graphs. ...
We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs using the ∆-stepping parallel algorithm. ...
We acknowledge the algorithmic inputs from Bruce Hendrickson of Sandia National Laboratories. We would also like to thank John Feo of Cray for helping us optimize the MTA-2 implementation. ...
doi:10.1137/1.9781611972870.3
dblp:conf/alenex/MadduriBBC07
fatcat:vzlqjuezajaprdd6p7tc52irfe
Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net
2013
2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We focus on the problem of scalable shortest path analytics for large social graphs in this paper. ...
While shortest path distance problem has been investigated extensively, massive graphs on social networks such as Facebook and LinkedIn call for reinvestigation of the problem due to the requirements of ...
For example, both of Dijkstra's algorithm and Bellman-Ford algorithm are efficient in searching for shortest paths on weighted and directed graphs. ...
doi:10.1109/wi-iat.2013.59
dblp:conf/webi/FuD13
fatcat:yi4ji4ooivhfhkfnuonrykgmji
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
[chapter]
2009
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We report on initial experimental results for a practical I/O-efficient Single-Source Shortest-Paths (SSSP) algorithm on general undirected sparse graphs where the ratio between the largest and the smallest ...
edge weight is reasonably bounded (for example integer weights in {1, . . . , 2 32 }) and the realistic assumption holds that main memory is big enough to keep one bit per vertex. ...
We would like to thank Deepak Ajwani and Andreas Beckmann for helpful discussions and assistance with the flash disks. ...
doi:10.1137/1.9781611972894.9
dblp:conf/alenex/MeyerO09
fatcat:occf2vj5ynawvkfdgaep7m26vu
JGraphT – A Java library for graph data structures and algorithms
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Besides classic graph algorithms such as shortest-paths and spanning-tree algorithms, the library contains numerous advanced algorithms: graph and subgraph isomorphism; matching and flow problems; approximation ...
algorithms for NP-hard problems such as independent set and TSP; and several more exotic algorithms such as Berge graph detection. ...
We would like to thank all contributors to the project and especially Timofey Chudakov, Semen Chudakov, Alexandru Vȃleanu, Ilya Razenshteyn, Alexey Kudinkin, and Philipp Kaesgen for their effort in improving ...
arXiv:1904.08355v2
fatcat:vzv6n26i4fcohga7r5ww7exgay
Approximating Betweenness Centrality in Large Evolving Networks
[chapter]
2014
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is enabled by investing memory to store and efficiently update shortest paths. ...
We address this deficit by proposing two incremental approximation algorithms (for weighted and unweighted connected graphs) which provide a provable guarantee on the absolute approximation error. ...
This work is partially supported by German Research Foundation (DFG) grant FINCA (Fast We thank Pratistha Bhattarai (Smith College) for help with the experimental evaluation. ...
doi:10.1137/1.9781611973754.12
dblp:conf/alenex/BergaminiMS15
fatcat:yahsuk4hbrgznhbociwwrt6jse
Approximating Betweenness Centrality in Large Evolving Networks
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is enabled by investing memory to store and efficiently update shortest paths. ...
We address this deficit by proposing two incremental approximation algorithms (for weighted and unweighted connected graphs) which provide a provable guarantee on the absolute approximation error. ...
This work is partially supported by German Research Foundation (DFG) grant FINCA (Fast We thank Pratistha Bhattarai (Smith College) for help with the experimental evaluation. ...
arXiv:1409.6241v1
fatcat:upgmws5h5zf3tpi677ruik76ay
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Many graph codes have been designed for distributed memory or external memory. ...
Nevertheless, most experimental work in the literature report results on much smaller graphs, and the ones that use the Hyperlink graph are done in distributed or external memory. ...
ACKNOWLEDGEMENTS Thanks to the reviewers and to Lin Ma for helpful comments. This work was supported in part by NSF grants CCF-1408940, CCF-1533858, and CCF-1629444. ...
doi:10.1145/3210377.3210414
dblp:conf/spaa/DhulipalaBS18
fatcat:kjoegz2o65ab3oppglhc4bl6fu
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2012.11128v1 fatcat:wnukutxwhfeezlnoecpquymxx4
On the host side, we propose a preprocessing algorithm Pre-BFS to reduce the graph size and search space. ...
On the FPGA side in PEFP, we propose a novel DFS-based batching technique to save on-chip memory efficiently. ...
Xuemin Lin is supported by 2018YFB1003504, NSFC61232006, ARC DP200101338, ARC DP180103096 and ARC DP170101628. Wenjie Zhang is supported by ARC DP200101116 and DP180103096. ...
arXiv:2012.11128v2
fatcat:wlwbhd7d6fdrpjoc4g3tklmq5e
Distributed Graph Diameter Approximation
2020
Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. ...
Theoretically, our algorithm uses linear space and yields a polylogarithmic approximation guarantee; most importantly, for a large family of graphs, it features a round complexity asymptotically smaller ...
Acknowledgments: The authors wish to thank the anonymous referees for their constructive criticisms which helped improve the quality of the paper. ...
doi:10.3390/a13090216
fatcat:744uvadkf5benfu5zjumiwloie
« Previous
Showing results 1 — 15 out of 1,480 results