Login / Signup

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.

Yosuke YanoTakuya AkibaYoichi IwataYuichi Yoshida
Published in: CIKM (2013)
Keyphrases
  • reachability queries
  • labeling scheme
  • data objects
  • structured databases
  • main memory
  • massive graphs
  • shortest path
  • databases