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.
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. [link]Link  Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. [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