Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. He, M., Munro, J. I., Nekrich, Y., Wild, S., & Wu, K. In Cao, Y., Cheng, S., & Li, M., editors, ISAAC, volume 181, of LIPIcs, pages 25:1-25:18, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Link Paper bibtex @inproceedings{conf/isaac/0001MNWW20,
added-at = {2021-09-16T00:00:00.000+0200},
author = {He, Meng and Munro, J. Ian and Nekrich, Yakov and Wild, Sebastian and Wu, Kaiyu},
biburl = {https://www.bibsonomy.org/bibtex/2bd69ae281bc1546da662e213846a9583/dblp},
booktitle = {ISAAC},
crossref = {conf/isaac/2020},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.25},
interhash = {8a21568759ff9d942ee678d45b19aa0f},
intrahash = {bd69ae281bc1546da662e213846a9583},
isbn = {978-3-95977-173-3},
keywords = {dblp},
pages = {25:1-25:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-08-26T07:35:54.000+0200},
title = {Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.},
url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2020.html#0001MNWW20},
volume = 181,
year = 2020
}
Downloads: 0
{"_id":"eo98bS7pZi6Jdtxtj","bibbaseid":"he-munro-nekrich-wild-wu-distanceoraclesforintervalgraphsviabreadthfirstrankselectinsuccincttrees-2020","author_short":["He, M.","Munro, J. I.","Nekrich, Y.","Wild, S.","Wu, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2021-09-16T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["He"],"firstnames":["Meng"],"suffixes":[]},{"propositions":[],"lastnames":["Munro"],"firstnames":["J.","Ian"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]},{"propositions":[],"lastnames":["Wild"],"firstnames":["Sebastian"],"suffixes":[]},{"propositions":[],"lastnames":["Wu"],"firstnames":["Kaiyu"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2bd69ae281bc1546da662e213846a9583/dblp","booktitle":"ISAAC","crossref":"conf/isaac/2020","editor":[{"propositions":[],"lastnames":["Cao"],"firstnames":["Yixin"],"suffixes":[]},{"propositions":[],"lastnames":["Cheng"],"firstnames":["Siu-Wing"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Minming"],"suffixes":[]}],"ee":"https://doi.org/10.4230/LIPIcs.ISAAC.2020.25","interhash":"8a21568759ff9d942ee678d45b19aa0f","intrahash":"bd69ae281bc1546da662e213846a9583","isbn":"978-3-95977-173-3","keywords":"dblp","pages":"25:1-25:18","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series":"LIPIcs","timestamp":"2024-08-26T07:35:54.000+0200","title":"Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.","url":"http://dblp.uni-trier.de/db/conf/isaac/isaac2020.html#0001MNWW20","volume":"181","year":"2020","bibtex":"@inproceedings{conf/isaac/0001MNWW20,\n added-at = {2021-09-16T00:00:00.000+0200},\n author = {He, Meng and Munro, J. Ian and Nekrich, Yakov and Wild, Sebastian and Wu, Kaiyu},\n biburl = {https://www.bibsonomy.org/bibtex/2bd69ae281bc1546da662e213846a9583/dblp},\n booktitle = {ISAAC},\n crossref = {conf/isaac/2020},\n editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},\n ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.25},\n interhash = {8a21568759ff9d942ee678d45b19aa0f},\n intrahash = {bd69ae281bc1546da662e213846a9583},\n isbn = {978-3-95977-173-3},\n keywords = {dblp},\n pages = {25:1-25:18},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},\n series = {LIPIcs},\n timestamp = {2024-08-26T07:35:54.000+0200},\n title = {Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.},\n url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2020.html#0001MNWW20},\n volume = 181,\n year = 2020\n}\n\n","author_short":["He, M.","Munro, J. I.","Nekrich, Y.","Wild, S.","Wu, K."],"editor_short":["Cao, Y.","Cheng, S.","Li, M."],"key":"conf/isaac/0001MNWW20","id":"conf/isaac/0001MNWW20","bibbaseid":"he-munro-nekrich-wild-wu-distanceoraclesforintervalgraphsviabreadthfirstrankselectinsuccincttrees-2020","role":"author","urls":{"Link":"https://doi.org/10.4230/LIPIcs.ISAAC.2020.25","Paper":"http://dblp.uni-trier.de/db/conf/isaac/isaac2020.html#0001MNWW20"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","dataSources":["f7XsgZohqQ3Rphbct"],"keywords":["dblp"],"search_terms":["distance","oracles","interval","graphs","via","breadth","first","rank","select","succinct","trees","he","munro","nekrich","wild","wu"],"title":"Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.","year":2020}