Assessing the computational complexity of multi-layer subgraph detection (Q5283362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Assessing the computational complexity of multi-layer subgraph detection |
scientific article; zbMATH DE number 6751057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Assessing the computational complexity of multi-layer subgraph detection |
scientific article; zbMATH DE number 6751057 |
Statements
Assessing the Computational Complexity of Multi-layer Subgraph Detection (English)
0 references
21 July 2017
0 references
0.7195950150489807
0 references
0.7073590755462646
0 references
0.7013272643089294
0 references
0.6960582137107849
0 references
