Assessing the computational complexity of multilayer subgraph detection

international conference on algorithms and complexity, pp. 215-241, 2019.

Cited by: 7|Views51
EI

Abstract:

Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the border of computational (in)tractability for the class of subgraph detection problems on multi-laye...More

Code:

Data:

Your rating :
0

 

Tags
Comments