Assessing the Computational Complexity of Multi-Layer Subgraph Detection
  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-layer graphs, including fundamental problems such as maximum matching, finding certain clique relaxations (motivated by community detection), or path problems. Mostly encountering hardness results, sometimes even for two or three layers, we can also spot some islands of tractability. 
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik   Molter, Rolf Niedermeier, Manuel Sorge
cs.CC cs.DM cs.DS