Finding approximate and constrained motifs in graphs (Q390871)
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: Finding approximate and constrained motifs in graphs |
scientific article; zbMATH DE number 6243773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding approximate and constrained motifs in graphs |
scientific article; zbMATH DE number 6243773 |
Statements
Finding approximate and constrained motifs in graphs (English)
0 references
9 January 2014
0 references
graph motif
0 references
computational biology
0 references
parameterized complexity
0 references
algorithms
0 references
computational complexity
0 references
biological networks
0 references
0.959514617919922
0 references
0.8696828484535217
0 references
0.8667123317718506
0 references
0.8468232750892639
0 references
0.8454174399375916
0 references
