Efficient Computation of Feedback Arc Set at Web-Scale
Summary: Targets NP-hard minimum feedback arc set on web-scale graphs, applying careful algorithmic engineering to test scalable approximations. Greedy and randomized methods scale to billions of vertices and arcs, outperforming rivals; tested on social networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,101 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.5598015e-05 |
| 6,015 | Linearized and Single-Pass Belief Propagation | 2015 | VLDB | 5.2415551e-05 |
Previous
Page 1 / 1
Next