Holistic Subgraph Search over Large Graphs

Due to its wide applications, subgraph matching problem has been studied extensively in the past decade. In this paper, we consider the subgraph match query in a more general scenario. We build a structural index that does not depend on any vertex content. Our method can be applied in graphs with any kind of vertex/edge content. Based on the index, we design a holistic subgraph matching algorithm. This paper is the first effort of the holistic pattern matching approach in the subgraph query problem. It can dramatically reduce the search space. Extensive experiments on real graphs show that our method outperforms state-of-the-art algorithms.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000342838500023&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Computer Science, Information SystemsComputer Science, Theory & MethodsEICPCI-S(ISTP)