Finding and counting small induced subgraphs efficiently (Q294749): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150875823 / rank | |||
Normal rank | |||
Latest revision as of 11:32, 30 July 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
