Epasto et al. Efficient Densest Subgraph Computation in Evolving Graphs, WWW, 2015
C++ Makefile
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
DSAlgs.cpp
DSAlgs.h
DynDSAlg.cpp
DynDSAlg.h
DynDSAlgAddRem.cpp
DynDSAlgAddRem.h
DynGraph.cpp
DynGraph.h
DynGraphUtils.cpp
DynGraphUtils.h
ExecAdd.cpp
ExecAddRem.cpp
GraphScheduler.cpp
GraphScheduler.h
LICENSE
Makefile
README.md
Stats.cpp
Stats.h
UDynGraph.cpp
UDynGraph.h

README.md

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} }