Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7051766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the number of induced copies of a fixed graph in a bounded degree graph |
scientific article; zbMATH DE number 7051766 |
Statements
Computing the number of induced copies of a fixed graph in a bounded degree graph (English)
0 references
7 May 2019
0 references
induced graph
0 references
computational counting
0 references
fixed-parameter tractability
0 references
0 references
0.782039225101471
0 references
0.7811920642852783
0 references
0.7727411985397339
0 references
0.7573415040969849
0 references
0.7534975409507751
0 references
