Finding approximate and constrained motifs in graphs (Q390871): Difference between revisions
From MaRDI portal
Latest revision as of 04:34, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding approximate and constrained motifs in graphs |
scientific article |
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