Efficient algorithms for node disjoint subgraph homeomorphism determination

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

Volumn 4947 LNCS, Issue , 2008, Pages 452-460

  Xiao, Yanghua ^a   Wu, Wentao ^a   Wang, Wei ^a   He, Zhenying ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HEURISTIC PROGRAMMING; SET THEORY; STATE SPACE METHODS; TELECOMMUNICATION NETWORKS;

ADVANCED APPLICATIONS; COMPUTATIONALLY EFFICIENT; DENSE GRAPHS; EFFICIENT ALGORITHMS; FUZZY MATCHING; GRAPH ISOMORPHISM; GRAPH-BASED; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; NODE-DISJOINT; SEARCH SPACES; STATE SPACES; SUB GRAPHS; SYNTHETIC DATA SETS;

DATABASE SYSTEMS;

EID: 47349096504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78568-2_34     Document Type: Conference Paper

References (10)

1. Kelley, R.B., et al.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. PNAS 100(20), 11394-11399 (2003)
2. Sharan, R., et al.: Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. In: RECOMB 2004, pp. 282-289 (2004)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (2003)
4. Robertson, N., Seymour, P.D.: Graph minors. XIII: The disjoint paths problem. Journal of Combinatorial Theory 63, 65-110 (1995)
5. IIIya, V.: Hicks:Branch Decompositions and Minor Containment. Networks 43(1), 1-9 (2004)
6. Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the ACM 23, 31-42 (1976)
7. Diestel, R.: Graph Theory. Springer, Heidelberg (2000)
8. Jin, R., Wang, C., Polshakov, D., Parthasarathy, S., Agrawal, G.: Discovering frequent topological structures from graph datasets. In: KDD 2005, Chicago,USA, pp. 606-611 (2005)
9. Nilsson, N.J.: Principles of Artificial Intelligence. Springer, Heidelberg (1982)
10. Erd̈os, P., Rényi, A.: On random graphs. Publicationes Mathematicae, 290-297 (1959)