A new study suggests that a simple change to how online matchmaking platforms display profiles can significantly improve user ...
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 ...
Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results