Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the number of induced copies of a fixed graph in a bounded degree graph |
scientific article |
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
