An active area of research in computational science is the design of algorithms for solving the subgraph matching problem to find copies of a given template graph in a larger world graph. Prior works have largely addressed single-channel networks using a variety of approaches. We present a suite of filtering methods for subgraph isomorphisms for multiplex networks (with different types of edges between nodes and more than one edge within each channel type). We aim to understand the entire solution space rather than focusing on finding one isomorphism. Results are shown on several classes of datasets: (a) Sudoku puzzles mapped to the subgraph isomorphism problem, (b) Erdős-Rényi multigraphs, (c) real-world datasets from Twitter and transportation networks, (d) synthetic data created for the DARPA MAA program.

中文翻译：

---

多路网络上的子图匹配

计算科学中一个活跃的研究领域是设计用于解决子图匹配问题的算法，以在更大的世界图中找到给定模板图的副本。先前的工作主要使用各种方法解决单通道网络。我们提出了一套用于多路网络子图同构的过滤方法（节点之间有不同类型的边，并且每个通道类型中有一个以上的边）。我们的目标是理解整个解空间，而不是专注于寻找一个同构。结果显示在几类数据集上：(a) 映射到子图同构问题的数独谜题，(b) Erdős-Rényi 多重图，(c) 来自 Twitter 和交通网络的真实世界数据集，(d) 为DARPA MAA 计划。