Efficient algorithms for node disjoint subgraph homeomorphism determination

Authors:
Yanghua Xiao;Wentao Wu;Wei Wang;Zhenying He
Affiliations:
Department of Computing and Information Technology, FuDan University, ShangHai, China;Department of Computing and Information Technology, FuDan University, ShangHai, China;Department of Computing and Information Technology, FuDan University, ShangHai, China;Department of Computing and Information Technology, FuDan University, ShangHai, China
Venue:
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Year:
2008

Citing 7
Cited 2

Principles of artificial intelligence

Principles of artificial intelligence
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Branch decompositions and minor containment

Networks
Discovering frequent topological structures from graph datasets

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining

Frequent approximate subgraphs as features for graph-based image classification

Knowledge-Based Systems
A new proposal for graph-based image classification using frequent approximate subgraphs

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.