Finding and counting small induced subgraphs efficiently (Q294749): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56210426, #quickstatements; #temporary_batch_1706389175803 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:11, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding and counting small induced subgraphs efficiently |
scientific article |
Statements
Finding and counting small induced subgraphs efficiently (English)
0 references
16 June 2016
0 references
graph algorithms
0 references
simplicial vertex
0 references
claw-free graph
0 references
diamond-free graph
0 references
