Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/cikm/0002AK16
AU - Hayashi, Takanori
AU - Akiba, Takuya
AU - Kawarabayashi, Ken-ichi
TI - Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks.
BT - Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016
SP - 1533
EP - 1542
PY - 2016//
DO - 10.1145/2983323.2983731
UR - https://doi.org/10.1145/2983323.2983731
ER -
TY - CPAPER
ID - DBLP:conf/ijcai/HayashiAY16
AU - Hayashi, Takanori
AU - Akiba, Takuya
AU - Yoshida, Yuichi
TI - Efficient Algorithms for Spanning Tree Centrality.
BT - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016
SP - 3733
EP - 3739
PY - 2016//
UR - http://www.ijcai.org/Abstract/16/525
ER -
TY - JOUR
ID - DBLP:journals/pvldb/HayashiAY15
AU - Hayashi, Takanori
AU - Akiba, Takuya
AU - Yoshida, Yuichi
TI - Fully Dynamic Betweenness Centrality Maintenance on Massive Networks.
JO - Proc. VLDB Endow.
VL - 9
IS - 2
SP - 48
EP - 59
PY - 2015//
UR - http://www.vldb.org/pvldb/vol9/p48-hayashi.pdf
UR - https://doi.org/10.14778/2850578.2850580
ER -
TY - CPAPER
ID - DBLP:conf/aaai/AkibaHNIY15
AU - Akiba, Takuya
AU - Hayashi, Takanori
AU - Nori, Nozomi
AU - Iwata, Yoichi
AU - Yoshida, Yuichi
TI - Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.
BT - Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA.
SP - 2
EP - 8
PY - 2015//
DO - 10.1609/AAAI.V29I1.9154
UR - https://doi.org/10.1609/aaai.v29i1.9154
ER -
