Back to Results
First PageMeta Content
Graph theory / Mathematics / Spanning tree / Dense subgraph / Graph coloring / Combinatorial optimization / Routing algorithms / Line graph / Tree-depth


Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi
Add to Reading List

Document Date: 2015-07-21 16:42:36

Open Document

File Size: 408,04 KB

Share Result on Facebook