Skip to content

Epasto et al. Efficient Densest Subgraph Computation in Evolving Graphs, WWW, 2015

License

Notifications You must be signed in to change notification settings

aepasto/densest-subgraph

Repository files navigation

README:

If you use our code your are required to cite our paper:

Epasto, Alessandro, Silvio Lattanzi, and Mauro Sozio. "Efficient densest subgraph computation in evolving graphs." Proceedings of the 24th International Conference on World Wide Web. ACM, 2015.

Bibtex:

@inproceedings{epasto2015efficient, title={Efficient densest subgraph computation in evolving graphs}, author={Epasto, Alessandro and Lattanzi, Silvio and Sozio, Mauro}, booktitle={Proceedings of the 24th International Conference on World Wide Web}, pages={300--310}, year={2015}, organization={ACM} }

About

Epasto et al. Efficient Densest Subgraph Computation in Evolving Graphs, WWW, 2015

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published