Assessing the computational complexity of multi-layer subgraph detection

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

doi:10.1007/978-3-319-57586-5_12

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 proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

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 diﬀerent 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 language	English
Title of host publication	Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings
Editors	Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
Publisher	Springer Verlag
Pages	128-139
Number of pages	12
ISBN (Print)	9783319575858
DOIs	https://doi.org/10.1007/978-3-319-57586-5_12
State	Published - 1 Jan 2017
Externally published	Yes
Event	10th International Conference on Algorithms and Complexity, CIAC 2017 - Athens, Greece Duration: 24 May 2017 → 26 May 2017

Publication series

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

Conference

Conference	10th International Conference on Algorithms and Complexity, CIAC 2017
Country/Territory	Greece
City	Athens
Period	24/05/17 → 26/05/17

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-57586-5_12

Cite this

Bredereck, R., Komusiewicz, C., Kratsch, S., Molter, H., Niedermeier, R., & Sorge, M. (2017). Assessing the computational complexity of multi-layer subgraph detection. In D. Fotakis, A. Pagourtzis, & V. T. Paschos (Eds.), Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings (pp. 128-139). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10236 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-57586-5_12

Bredereck, Robert ; Komusiewicz, Christian ; Kratsch, Stefan et al. / Assessing the computational complexity of multi-layer subgraph detection. Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings. editor / Dimitris Fotakis ; Aris Pagourtzis ; Vangelis Th. Paschos. Springer Verlag, 2017. pp. 128-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{56735ac6ec844fef9f0f0d55838bd304,

title = "Assessing the computational complexity of multi-layer subgraph detection",

abstract = "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 diﬀerent 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.",

author = "Robert Bredereck and Christian Komusiewicz and Stefan Kratsch and Hendrik Molter and Rolf Niedermeier and Manuel Sorge",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 10th International Conference on Algorithms and Complexity, CIAC 2017 ; Conference date: 24-05-2017 Through 26-05-2017",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-319-57586-5_12",

language = "English",

isbn = "9783319575858",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "128--139",

editor = "Dimitris Fotakis and Aris Pagourtzis and Paschos, {Vangelis Th.}",

booktitle = "Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings",

address = "Germany",

}

Bredereck, R, Komusiewicz, C, Kratsch, S, Molter, H, Niedermeier, R & Sorge, M 2017, Assessing the computational complexity of multi-layer subgraph detection. in D Fotakis, A Pagourtzis & VT Paschos (eds), Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10236 LNCS, Springer Verlag, pp. 128-139, 10th International Conference on Algorithms and Complexity, CIAC 2017, Athens, Greece, 24/05/17. https://doi.org/10.1007/978-3-319-57586-5_12

Assessing the computational complexity of multi-layer subgraph detection. / Bredereck, Robert; Komusiewicz, Christian; Kratsch, Stefan et al.
Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings. ed. / Dimitris Fotakis; Aris Pagourtzis; Vangelis Th. Paschos. Springer Verlag, 2017. p. 128-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10236 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Assessing the computational complexity of multi-layer subgraph detection

AU - Bredereck, Robert

AU - Komusiewicz, Christian

AU - Kratsch, Stefan

AU - Molter, Hendrik

AU - Niedermeier, Rolf

AU - Sorge, Manuel

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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 diﬀerent 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.

AB - 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 diﬀerent 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.

UR - http://www.scopus.com/inward/record.url?scp=85018449651&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-57586-5_12

DO - 10.1007/978-3-319-57586-5_12

M3 - Conference contribution

AN - SCOPUS:85018449651

SN - 9783319575858

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 128

EP - 139

BT - Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings

A2 - Fotakis, Dimitris

A2 - Pagourtzis, Aris

A2 - Paschos, Vangelis Th.

PB - Springer Verlag

T2 - 10th International Conference on Algorithms and Complexity, CIAC 2017

Y2 - 24 May 2017 through 26 May 2017

ER -

Bredereck R, Komusiewicz C, Kratsch S, Molter H, Niedermeier R, Sorge M. Assessing the computational complexity of multi-layer subgraph detection. In Fotakis D, Pagourtzis A, Paschos VT, editors, Algorithms and Complexity - 10th International Conference, CIAC 2017, Proceedings. Springer Verlag. 2017. p. 128-139. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-57586-5_12

Assessing the computational complexity of multi-layer subgraph detection

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this