Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/FellowsFHV11, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/FellowsFHV11 / rank | |||
Normal rank | |||
Latest revision as of 06:35, 13 November 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
0 references
