DBScholar

Back to papers

Distributed Graph Simulation: Impossibility and Possibility

Summary: Proves that distributed graph simulation cannot be parallel-scalable in response time or data shipment independent of graph size. Establishes partition-bounded guarantees based on largest fragment and cross-fragment nodes/edges, with matching algorithms and special scalable cases. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10956
Venue
VLDB
Year
2014
Pagerank
6.0539311e-05
Overall Rank
5,878 | 59.68%
DOI
10.14778/2732977.2732979

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{fan_vldb14,
        title = {{Distributed Graph Simulation: Impossibility and Possibility}},
        author = {Fan, Wenfei and Wang, Xin and Wu, Yinghui and Deng, Dong},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {12},
        pages = {1083--1094},
        doi = {10.14778/2732977.2732979},
        url = {https://doi.org/10.14778/2732977.2732979},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers