Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q57359721, #quickstatements; #temporary_batch_1710326039812 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57359721 / rank | |||
Normal rank | |||
Revision as of 11:34, 13 March 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
