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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Network science (Cambridge University Press) Jg. 7; H. 2; S. 215 - 241
Hauptverfasser:	Bredereck, Robert, Komusiewicz, Christian, Kratsch, Stefan, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, USA Cambridge University Press 01.06.2019
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!