子图同构问题
诱导子图同构问题
图同构
匹配(统计)
计算机科学
图因式分解
多路复用
理论计算机科学
同构(结晶学)
图形
GSM演进的增强数据速率
组合数学
数学
人工智能
折线图
电压图
化学
生物信息学
统计
晶体结构
生物
结晶学
作者
Jacob D. Moorman,Thomas K. Tu,Qinyi Chen,Xie He,Andrea L. Bertozzi
标识
DOI:10.1109/tnse.2021.3056329
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI