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

Celý popis

Podrobná bibliografia

Vydané v:	Network science (Cambridge University Press) Ročník 7; číslo 2; s. 215 - 241
Hlavní autori:	Bredereck, Robert, Komusiewicz, Christian, Kratsch, Stefan, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, USA Cambridge University Press 01.06.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!