A Framework for Subgraph Detection in Interdependent Networks via Graph Block-Structured Optimization
As the backbone of many real-world complex systems, networks interact with others in nontrivial ways from time to time. It is a challenging problem to detect subgraphs that have dependencies on each other across multiple networks. Instead of devising a method for a specific scenario, we propose a ge...
Main Authors: | Fei Jie, Chunpai Wang, Feng Chen, Lei Li, Xindong Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9173671/ |
Similar Items
-
Abnormal Trajectory Detection Based on a Sparse Subgraph
by: Xujun Zhao, et al.
Published: (2020-01-01) -
Coverability of Graphs by Parity Regular Subgraphs
by: Mirko Petruševski, et al.
Published: (2021-01-01) -
Dense subgraph mining in probabilistic graphs
by: Esfahani, Fatemeh
Published: (2021) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
Forbidden subgraph pairs for traceability of block-chains
by: Binlong Li, et al.
Published: (2013-04-01)