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.
Though VC-PLL can be described in a natural Vertex- Centric computational scheme, it also demonstrates certai n limitations of the original vertex-centric model assumpti ons
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.