Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314)
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: Upper and lower bounds for finding connected motifs in vertex-colored graphs |
scientific article; zbMATH DE number 5882197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for finding connected motifs in vertex-colored graphs |
scientific article; zbMATH DE number 5882197 |
Statements
Upper and lower bounds for finding connected motifs in vertex-colored graphs (English)
0 references
28 April 2011
0 references
graph motif
0 references
graph pattern matching
0 references
parameterized complexity
0 references
W hardness
0 references
treewidth
0 references
0 references
