Finding and counting small induced subgraphs efficiently (Q294749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding and counting small induced subgraphs efficiently |
scientific article; zbMATH DE number 6594085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding and counting small induced subgraphs efficiently |
scientific article; zbMATH DE number 6594085 |
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
0.92604285
0 references
0.91637623
0 references
0.9077927
0 references
0.90656924
0 references
0.90649843
0 references
0.8989109
0 references
0.89642274
0 references
0.8961339
0 references
0.89395756
0 references
0.89210904
0 references
