{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:09Z","timestamp":1750220349597,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation (NSF)","award":["1815073"],"award-info":[{"award-number":["1815073"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461822","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"410-413","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Network Mapping Algorithms"],"prefix":"10.1145","author":[{"given":"Ramtin","family":"Afshar","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Pedro","family":"Matias","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Martha C.","family":"Osegueda","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"33rd Symp. on Theoretical Aspects of Computer Science (STACS) (LIPIcs","volume":"14","author":"Abrahamsen Mikkel","year":"2016","unstructured":"Mikkel Abrahamsen , Greg Bodwin , Eva Rotenberg , and Morten St\u00f6 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 Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, and Morten St\u00f6 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"},{"volume-title":"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","author":"Afshar Ramtin","key":"e_1_3_2_1_2_1","unstructured":"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 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"},{"key":"e_1_3_2_1_3_1","volume-title":"Reconstructing Biological and Digital Phylogenetic Trees in Parallel. In 28th European Symposium on Algorithms (ESA) (LIPIcs","volume":"24","author":"Afshar Ramtin","year":"2020","unstructured":"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 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"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103431071"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702420139"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248626"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/369133.369152"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11604686_2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.02.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.009"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L"},{"key":"e_1_3_2_1_14_1","volume-title":"On the Power of Additive Combinatorial Search Model. In 4th Int. Conf. on Computing and Combinatorics (COCOON) (LNCS","volume":"203","author":"Grebinski Vladimir","year":"1998","unstructured":"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 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"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00070-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010033"},{"key":"e_1_3_2_1_17_1","volume-title":"An optimal algorithm to reconstruct trees from additive distance data. Bulletin of mathematical biology","author":"Hein Jotun J","year":"1989","unstructured":"Jotun J Hein . 1989. An optimal algorithm to reconstruct trees from additive distance data. Bulletin of mathematical biology , Vol. 51 , 5 ( 1989 ), 597--603. Jotun J Hein. 1989. An optimal algorithm to reconstruct trees from additive distance data. Bulletin of mathematical biology, Vol. 51, 5 (1989), 597--603."},{"volume-title":"Balancing Graph Voronoi Diagrams. In Sixth International Symposium on Voronoi Diagrams. 183--191","author":"Honiden S.","key":"e_1_3_2_1_18_1","unstructured":"S. Honiden , M. E. Houle , and C. Sommer . 2009 . Balancing Graph Voronoi Diagrams. In Sixth International Symposium on Voronoi Diagrams. 183--191 . S. Honiden, M. E. Houle, and C. Sommer. 2009. Balancing Graph Voronoi Diagrams. In Sixth International Symposium on Voronoi Diagrams. 183--191."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3199606"},{"key":"e_1_3_2_1_20_1","volume-title":"14th ACM-SIAM Symposium on Discrete Algorithms (SODA). 444--453","author":"King Valerie","year":"2003","unstructured":"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 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"},{"volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis 2\/e ed.)","author":"Mitzenmacher Michael","key":"e_1_3_2_1_21_1","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and Computing: Randomized Algorithms and Probabilistic Analysis 2\/e ed.) . Cambridge University Press . Michael Mitzenmacher and Eli Upfal. 2017. Probability and Computing: Randomized Algorithms and Probabilistic Analysis 2\/e ed.). Cambridge University Press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.08.013"},{"key":"e_1_3_2_1_23_1","volume-title":"4th Int. Workshop on Algorithms and Computation (WALCOM) (LNCS","volume":"239","author":"Sen Sandeep","unstructured":"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 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"},{"key":"e_1_3_2_1_24_1","volume-title":"Efficient Measurement of Complex Networks Using Link Queries. CoRR","author":"Tarissan Fabien","year":"2009","unstructured":"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 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"},{"key":"e_1_3_2_1_25_1","volume-title":"Compact Routing Schemes. In 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Arnold L. Rosenberg (Ed.). 1--10","author":"Thorup Mikkel","year":"2001","unstructured":"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 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"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["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"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461822","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":25,"alternative-id":["10.1145\/3409964.3461822","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461822","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}