Structural graph indexing for mining complex networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 99-104

  Kardeş, Hakan ^a   Güneş, Mehmet Hadi ^a  

^a Department of Computer Science and Engineering   (United States)

Author keywords

Complex networks; Graph indexing; Graph mining; Structural graph indexing

Indexed keywords

COMPLEX NETWORKS; GRAPH INDEXING; GRAPH MINING; GRAPH STRUCTURES; INDEXING FEATURES; INTERNET GRAPHS; STRUCTURAL GRAPH;

ALGORITHMS; CHEMICAL COMPOUNDS; CHEMICALS; GRAPHIC METHODS; INDEXING (OF INFORMATION); INTERNET;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79952024206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2010.42     Document Type: Conference Paper

References (22)

1. Archipelago Measurement Infrastructure. http://www.caida.org/projects/ ark.
2. iPlane. http://iplane.cs.washington.edu/.
3. iToM: Internet Topology Mapper. http://itom.utdallas.edu.
4. N. M. A. Thomas, R. Cannings and C. Cannings. On the structure of protein-protein interaction networks. Biochem. Soc. Trans., 31:1491-1496, 2003.
5. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, 1973.
6. J. Cong and M. Smith. A parallel bottom-up clustering algorithm with applications to circuit partitioning in vlsi design. In DAC '93: Proceedings of the 30th international Design Automation Conference, pages 755-760, New York, NY, USA, 1993. ACM.
7. D. Cook and L. Holder. Mining graph data. John Wiley & Sons, 2006.
8. D. Fay, H. Haddadi, A. Thomason, A. W. Moore, R. Mortier, A. Jamakovic, S. Uhlig, and M. Rio. Ieee/acm transactions on networking 1 weighted spectral distribution for internet topology analysis: Theory and applications.
9. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
10. M. Gunes and K. Sarac. Resolving anonymous routers in Internet topology measurement studies. In IEEE INFOCOM, Phoenix, AZ, April 2007.
11. C. A. James, D. Weininger, and J. Delany. Daylight theory manual daylight version 4.82. daylight chemical information systems, 2003.
12. R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarity for indexing paths in graph-structured data. In In ICDE, pages 129-140, 2002.
13. H. V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane: An information plane for distributed services. In OSDI, November 2006.
14. T. Milo and D. Suciu. Index structures for path expressions, 1997.
15. R. Peeters. The maximum edge biclique problem is np-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
16. N. Rhodes, P. Willett, A. Calvet, J. B. Dunbar, and C. Humblet. Clip: similarity searching of 3d databases using clique detection. J Chem Inf Comput Sci., 43(2):443-448, 2003.
17. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986.
18. R. Samudrala and J. Moult. A graph-theoretic algorithm for comparative modeling of protein structure. Journal of Molecular Biology, 279(1):287-302, 1998. (Pubitemid 28252146)
19. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In In Symposium on Principles of Database Systems, pages 39-52, 2002.
20. Y. Shavitt and E. Shir. DIMES: Let the Internet measure itself. SIGCOMM Comput. Commun. Rev., 35(5):71-74, 2005.
21. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson. Measuring ISP topologies using rocketfuel. IEEE/ACM Transactions on Networking, 12(1):2-16, February 2004.
22. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach, 2004.