Assessing the computational complexity of multi-layer subgraph detection

Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where enti-ties (vertices) are assoc iated 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 m aximum 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.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings
EditorsDimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319575858
StatePublished - 1 Jan 2017
Externally publishedYes
Event10th International Conference on Algorithms and Complexity, CIAC 2017 - Athens, Greece
Duration: 24 May 201726 May 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10236 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Algorithms and Complexity, CIAC 2017

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Assessing the computational complexity of multi-layer subgraph detection'. Together they form a unique fingerprint.

Cite this