Parallel Network Mapping Algorithms
Pages 410 - 413
Abstract
Motivated from parallel network mapping, we provide efficient query complexity and round complexity bounds for graph reconstruction using distance queries, including a bound that improves a previous sequential complexity bound. Our methods use a high-probability parametric parallelization of a graph clustering technique of Thorup and Zwick, which may be of independent interest.
References
[1]
Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, and Morten Stö ckel. 2016. Graph Reconstruction with a Betweenness Oracle. In 33rd Symp. on Theoretical Aspects of Computer Science (STACS) (LIPIcs, Vol. 47), Nicolas Ollinger and Heribert Vollmer (Eds.). Schloss Dagstuhl, 5:1--5:14. https://doi.org/10.4230/LIPIcs.STACS.2016.5
[2]
Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda. 2020 a. Reconstructing Binary Trees in Parallel. In 32nd ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), Christian Scheideler and Michael Spear (Eds.). ACM, 491--492. https://doi.org/10.1145/3350755.3400229
[3]
Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda. 2020 b. Reconstructing Biological and Digital Phylogenetic Trees in Parallel. In 28th European Symposium on Algorithms (ESA) (LIPIcs, Vol. 173), Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders (Eds.). Schloss Dagstuhl, 3:1--3:24. https://doi.org/10.4230/LIPIcs.ESA.2020.3
[4]
Noga Alon and Vera Asodi. 2005. Learning a Hidden Subgraph. SIAM J. Discrete Math., Vol. 18, 4 (2005), 697--712. https://doi.org/10.1137/S0895480103431071
[5]
Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, and Benny Sudakov. 2004. Learning a Hidden Matching. SIAM J. Comput., Vol. 33, 2 (2004), 487--501. https://doi.org/10.1137/S0097539702420139
[6]
Dana Angluin and Jiang Chen. 2006. Learning a Hidden Hypergraph. J. Mach. Learn. Res., Vol. 7 (2006), 2215--2236. http://jmlr.org/papers/v7/angluin06a.html
[7]
Dana Angluin and Jiang Chen. 2008. Learning a hidden graph using O(log n) queries per edge. J. Comput. Syst. Sci., Vol. 74, 4 (2008), 546--556. https://doi.org/10.1016/j.jcss.2007.06.006
[8]
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matú s Mihalá k, and L. Shankar Ram. 2006. Network Discovery and Verification. IEEE Journal on Selected Areas in Communications, Vol. 24, 12 (2006), 2168--2181. https://doi.org/10.1109/JSAC.2006.884015
[9]
Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, and Lance Fortnow. 2001. An optimal procedure for gap closing in whole genome shotgun sequencing. In Fifth International Conference on Computational Biology (RECOMB), Thomas Lengauer (Ed.). ACM, 22--30. https://doi.org/10.1145/369133.369152
[10]
Mathilde Bouvel, Vladimir Grebinski, and Gregory Kucherov. 2005. Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. In 31st Int. Workshop on Graph-Theoretic Concepts in Computer Science (LNCS, Vol. 3787), Dieter Kratsch (Ed.). Springer, 16--27. https://doi.org/10.1007/11604686_2
[11]
Sung-Soon Choi and Jeong Han Kim. 2010. Optimal query complexity bounds for finding graphs. Artificial Intelligence, Vol. 174, 9 (2010), 551 -- 569. https://doi.org/10.1016/j.artint.2010.02.003
[12]
Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, and Alessandro Vespignani. 2006. Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science, Vol. 355, 1 (2006), 6--24. https://doi.org/10.1016/j.tcs.2005.12.009
[13]
Martin Erwig. 2000. The Graph Voronoi Diagram with Applications. Networks, Vol. 36, 3 (2000), 156--163. https://doi.org/10.1002/1097-0037(200010)36:3156::AID-NET23.0.CO;2-L
[14]
Vladimir Grebinski. 1998. On the Power of Additive Combinatorial Search Model. In 4th Int. Conf. on Computing and Combinatorics (COCOON) (LNCS, Vol. 1449), Wen-Lian Hsu and Ming-Yang Kao (Eds.). Springer, 194--203. https://doi.org/10.1007/3--540--68535--9_23
[15]
Vladimir Grebinski and Gregory Kucherov. 1998. Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discret. Appl. Math., Vol. 88, 1--3 (1998), 147--165. https://doi.org/10.1016/S0166--218X(98)00070--5
[16]
Vladimir Grebinski and Gregory Kucherov. 2000. Optimal Reconstruction of Graphs under the Additive Model. Algorithmica, Vol. 28, 1 (2000), 104--124. https://doi.org/10.1007/s004530010033
[17]
Jotun J Hein. 1989. An optimal algorithm to reconstruct trees from additive distance data. Bulletin of mathematical biology, Vol. 51, 5 (1989), 597--603.
[18]
S. Honiden, M. E. Houle, and C. Sommer. 2009. Balancing Graph Voronoi Diagrams. In Sixth International Symposium on Voronoi Diagrams. 183--191.
[19]
Sampath Kannan, Claire Mathieu, and Hang Zhou. 2018. Graph Reconstruction and Verification. ACM Trans. Algorithms, Vol. 14, 4 (2018), 40:1--40:30. https://doi.org/10.1145/3199606
[20]
Valerie King, Li Zhang, and Yunhong Zhou. 2003. On the complexity of distance-based evolutionary tree reconstruction. In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). 444--453. http://dl.acm.org/citation.cfm?id=644108.644179
[21]
Michael Mitzenmacher and Eli Upfal. 2017. Probability and Computing: Randomized Algorithms and Probabilistic Analysis 2/e ed.). Cambridge University Press.
[22]
Lev Reyzin and Nikhil Srivastava. 2007. On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett., Vol. 101, 3 (2007), 98--100. https://doi.org/10.1016/j.ipl.2006.08.013
[23]
Sandeep Sen and V. N. Muralidhara. 2010. The Covert Set-Cover Problem with Application to Network Discovery. In 4th Int. Workshop on Algorithms and Computation (WALCOM) (LNCS, Vol. 5942), Md. Saidur Rahman and Satoshi Fujita (Eds.). Springer, 228--239. https://doi.org/10.1007/978--3--642--11440--3_21
[24]
Fabien Tarissan, Matthieu Latapy, and Christophe Prieur. 2009. Efficient Measurement of Complex Networks Using Link Queries. CoRR, Vol. abs/0904.3222 (2009). arxiv: 0904.3222 http://arxiv.org/abs/0904.3222
[25]
Mikkel Thorup and Uri Zwick. 2001. Compact Routing Schemes. In 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Arnold L. Rosenberg (Ed.). 1--10. https://doi.org/10.1145/378580.378581
Index Terms
- Parallel Network Mapping Algorithms
Recommendations
Parallel algorithms for P4-comparability graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of such a graph. ...
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
In this paper, we consider the problem of interprocessor communication on parallel computers that have optical communication networks. We consider the completely connected optical-communication parallel computer (OCPC), which has a completely connected ...
Fast parallel chessboard distance transform algorithms
ICPADS '96: Proceedings of the 1996 International Conference on Parallel and Distributed SystemsIn this paper, based on the diagonal propagation approach, we first provide an O(N2) time sequential algorithm to compute the chessboard distance transform (CDT) of an N X N image, which is a DT using the chessboard distance metrics. Based on the ...
Comments
Information & Contributors
Information
Published In
July 2021
463 pages
Copyright © 2021 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 July 2021
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Funding Sources
- National Science Foundation (NSF)
Conference
SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures
July 6 - 8, 2021
Virtual Event, USA
Acceptance Rates
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 104Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in