Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:00, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for finding connected motifs in vertex-colored graphs |
scientific article |
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
