BVC-PLL applies a novel batch vertex-centric model to parallelize pruned landmark labeling while preserving exact results, achieving lower costs than the original PLL even sequentially under a stated assumption.
VC-PLL and BVC-PLL can be easily extended to handle directed graphs by considering these two labels as separate computations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
BVC-PLL applies a novel batch vertex-centric model to parallelize pruned landmark labeling while preserving exact results, achieving lower costs than the original PLL even sequentially under a stated assumption.