Hefei National Research Center for Physical Sciences at the Microscale and CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, ...
Abstract: Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science. It involves determining whether ...
RI is a general purpose algorithm for one-to-one exact subgraph isomorphism problem maintaining topological constraints. It is both a C++ library and a standalone tool, providing developing API and a ...
Abstract: Subgraph matching is a common and important query for analyzing social networks. However, existing subgraph matching algorithms are still unsatisfactory in efficiency. As different subgraph ...
In this paper, we present two divide-and-conquer algorithms for clustering large graphs. Both algorithms apply a base algorithm on several small subgraphs and then use these individual local ...
Each of the patterns comes with two java class, one for counting, one for outputting(class with name ended with O). More detail please read the code. Please run ...
We note here that the graph alignment problem has also been studied in other domains. For example, in computer vision, the problem of matching a query image to an existing image in the database has ...
Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results