Dense subgraphs on dynamic networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7611 LNCS, Issue , 2012, Pages 151-165

  Das Sarma, Atish ^a   Lall, Ashwin ^b   Nanongkai, Danupon ^c,d   Trehan, Amitabh ^e  

^a EBAY INC   (United States)

^b DENISON UNIVERSITY   (United States)

^c UNIVERSITY OF VIENNA   (Austria)

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^e TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION INFRASTRUCTURE; DENSE REGION; DISTRIBUTED NETWORKS; DYNAMIC NETWORK; GRAPH DENSITY; ON DYNAMICS; PARAMETER VALUES; SOCIAL NETWORKS; SPARSE GRAPHS; SUBGRAPH PROBLEMS; SUBGRAPHS; TIME STEP;

APPROXIMATION ALGORITHMS; PARAMETER ESTIMATION; WORLD WIDE WEB;

GRAPH THEORY;

EID: 84868366710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33651-5_11     Document Type: Conference Paper

References (43)

1. Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.E.: Local management of a global resource in a communication network. In: FOCS, pp. 347-357. IEEE Computer Society (1987)
2. Aggarwal, S., Kutten, S.: Time Optimal Self-Stabilizing Spanning Tree Algorithms. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 400-410. Springer, Heidelberg (1993)
3. Andersen, R., Chellapilla, K.: Finding Dense Subgraphs with Size Bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25-37. Springer, Heidelberg (2009)
4. Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Miller, R.E., Ginsburg, S., Burkhard, W.A., Lipton, R.J. (eds.) STOC, pp. 82-93. ACM (1980)
5. Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121(1-3), 15-26 (2002)
6. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons (2004)
7. Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454-465 (2012)
8. Berns, A., Ghosh, S.: Dissecting self-* properties. In: International Conference on Self-Adaptive and Self-Organizing Systems, pp. 10-19 (2009)
9. Bhaskara, A., Charikar, M., Vijayaraghavan, A., Guruswami, V., Zhou, Y.: Polynomial integrality gaps for strong sdp relaxations of densest k-subgraph. In: SODA, pp. 388-405 (2012)
10. Charikar, M.: Greedy Approximation Algorithms for Finding Dense Components in a Graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84-95. Springer, Heidelberg (2000)
11. Cidon, I., Shavitt, Y.: Message terminating algorithms for anonymous rings of unknown size. Inf. Process. Lett. 54(2), 111-119 (1995)
12. Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In: STOC, pp. 363-372 (2011)
13. Das Sarma, A., Lall, A., Nanongkai, D., Trehan, A.: Dense subgraphs on dynamic networks. CoRR abs/1208.1454 (2012)
14. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643-644 (1974), http://dx.doi.org/10.1145/361179.361202
15. Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
16. Dubhashi, D.P., Grandioni, F., Panconesi, A.: Distributed Algorithms via LP Duality and Randomization. In: Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC (2007)
17. Elkin, M.: An overview of distributed approximation. ACM SIGACT News Distributed Computing Column 35(4), 40-57 (2004)
18. Emek, Y., Korman, A.: New Bounds for the Controller Problem. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 22-34. Springer, Heidelberg (2009)
19. Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29 (1999)
20. Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: SODA, pp. 1150-1162 (2012)
21. Ghosh, D., Sharman, R., Raghav Rao, H., Upadhyaya, S.: Self-healing systems - survey and synthesis. Decis. Support Syst. 42(4), 2164-2185 (2007)
22. Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.Å., Ooi, B.C. (eds.) VLDB, pp. 721-732. ACM (2005)
23. Goldberg, A.V.: Finding a maximum density subgraph. Tech. Rep. UCB/CSD-84-171, EECS Department, University of California, Berkeley (1984)
24. Hayes, T., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 1-18, http://dx.doi.org/10.1007/s00446-012-0160-1, 10.1007, doi:10.1007/s00446-012- 0160-1
25. Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. In: PODC 2009: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 121-130. ACM, New York (2009)
26. Khan, M., Pandurangan, G.: A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing 20, 391-402 (2008)
27. Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., Talwar, K.: Efficient distributed approximation algorithms via probabilistic tree embeddings. In: PODC, pp. 263-272 (2008)
28. Khot, S.: Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Computing 36(4), 1025-1071 (2006)
29. Khuller, S., Saha, B.: On Finding Dense Subgraphs. In: Albers, S., Marchetti- Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 597-608. Springer, Heidelberg (2009)
30. Korman, A., Kutten, S.: Controller and estimator for dynamic networks. In: Gupta, I., Wattenhofer, R. (eds.) PODC, pp. 175-184. ACM (2007)
31. Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self stabilizing verification, computation, and fault detection of an MST. In: Gavoille, C., Fraigniaud, P. (eds.) PODC, pp. 311-320. ACM (2011)
32. Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513-522 (2010)
33. Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: PODC, pp. 1-10 (2011)
34. Kuhn, F., Schmid, S., Wattenhofer, R.: A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. In: van Renesse, R. (ed.) IPTPS 2005. LNCS, vol. 3640, pp. 13-23. Springer, Heidelberg (2005)
35. Lawler, E.: Combinatorial optimization - networks and matroids. Holt, Rinehart, and Winston (1976)
36. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo (1996)
37. Matias, Y., Afek, Y.: Simple and Efficient Election Algorithms for Anonymous Networks. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 183-194. Springer, Heidelberg (1989)
38. Nanongkai, D., Das Sarma, A., Pandurangan, G.: A tight unconditional lower bound on distributed randomwalk computation. In: PODC, pp. 257-266 (2011)
39. Pandurangan, G., Khan, M.: Theory of communication networks. In: Algorithms and Theory of Computation Handbook, 2nd edn. CRC Press (2009)
40. Pandurangan, G., Trehan, A.: Xheal: localized self-healing using expanders. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 301-310. ACM (2011), http://doi.acm.org/10.1145/1993806.1993865
41. Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
42. Poor, R., Bowman, C., Auburn, C.B.: Self-healing networks. Queue 1, 52-59 (2003), http://doi.acm.org/10.1145/846057.864027
43. Trehan, A.: Algorithms for self-healing networks. Dissertation, University of New Mexico (2010)