Skip to main content

Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNISA,volume 4947)


Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has been shown to be more suitable than (sub)graph isomorphism in many cases, especially in those cases where node skipping and node mismatching are desired. However, no efficient algorithm for node disjoint subgraph homeomorphism determination (ndSHD) has been available. In this paper, we propose two computationally efficient ndSHD algorithms based on state spaces searching with backtracking, which employ many heuristics to prune the search spaces. Experimental results on synthetic data sets show that the proposed algorithms are efficient, require relatively little time in most of cases, can scale to large or dense graphs, and can accommodate to more complex fuzzy matching cases.

The work was supported by the National Natural Science Foundation of China under Grant No.60303008, No.60673133, No.60703093; the National Grand Fundamental Research 973 Program of China under Grant No.2005CB321905.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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)

    CrossRef  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  4. Robertson, N., Seymour, P.D.: Graph minors. XIII: The disjoint paths problem. Journal of Combinatorial Theory 63, 65–110 (1995)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. IIIya, V.: Hicks:Branch Decompositions and Minor Containment. Networks 43(1), 1–9 (2004)

    CrossRef  MathSciNet  Google Scholar 

  6. Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the ACM 23, 31–42 (1976)

    CrossRef  MathSciNet  Google Scholar 

  7. Diestel, R.: Graph Theory. Springer, Heidelberg (2000)

    Google Scholar 

  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)

    Google Scholar 

  9. Nilsson, N.J.: Principles of Artificial Intelligence. Springer, Heidelberg (1982)

    MATH  Google Scholar 

  10. Erdös, P., Rényi, A.: On random graphs. Publicationes Mathematicae, 290–297 (1959)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, Y., Wu, W., Wang, W., He, Z. (2008). Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds) Database Systems for Advanced Applications. DASFAA 2008. Lecture Notes in Computer Science, vol 4947. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78567-5

  • Online ISBN: 978-3-540-78568-2

  • eBook Packages: Computer ScienceComputer Science (R0)