Assessing the computational complexity of multilayer subgraph detection

Multilayer graphs consist of several graphs, called layers, where the vertex set of all layers is the same but each layer has an individual edge set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We...

Full description

Bibliographic Details

Published in:	Network science (Cambridge University Press) Vol. 7; no. 2; pp. 215 - 241
Main Authors:	Bredereck, Robert, Komusiewicz, Christian, Kratsch, Stefan, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel
Format:	Journal Article
Language:	English
Published:	New York, USA Cambridge University Press 01.06.2019
Subjects:	Algorithms Cardinality Graphs Islands Original Article World problems multi-modal data exact algorithms parameterized computational complexity community detection Hamiltonian path matching
ISSN:	2050-1242, 2050-1250
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!