ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1907.00140
  4. Cited By
Planting Trees for scalable and efficient Canonical Hub Labeling

Planting Trees for scalable and efficient Canonical Hub Labeling

Proceedings of the VLDB Endowment (PVLDB), 2019
29 June 2019
Kartik Lakhotia
Qing Dong
Rajgopal Kannan
Viktor Prasanna
ArXiv (abs)PDFHTML

Papers citing "Planting Trees for scalable and efficient Canonical Hub Labeling"

1 / 1 papers shown
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip
  decomposition of Bipartite Graphs
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite GraphsProceedings of the VLDB Endowment (PVLDB), 2020
Kartik Lakhotia
Rajgopal Kannan
Viktor Prasanna
C. Rose
240
14
0
17 Oct 2020
1
Page 1 of 1