Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376)
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 7377193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting and enumerating small induced subgraphs in \(c\)-closed graphs |
scientific article; zbMATH DE number 7377193 |
Statements
Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (English)
0 references
2 August 2021
0 references
FPT in P
0 references
combinatorial algorithms
0 references
subgraph detection
0 references
subgraph enumeration
0 references
0 references
0.7888965606689453
0 references
0.7552468180656433
0 references
0.7498440146446228
0 references
0.7249192595481873
0 references
0.7218314409255981
0 references