Enumerating simple paths from connected induced subgraphs (Q1756087)
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 7000683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating simple paths from connected induced subgraphs |
scientific article; zbMATH DE number 7000683 |
Statements
Enumerating simple paths from connected induced subgraphs (English)
0 references
11 January 2019
0 references
directed graph
0 references
self-avoiding walks
0 references
simple cycles
0 references
Hamiltonian paths
0 references
dominating sets
0 references
inclusion-exclusion
0 references
0.7742581367492676
0 references
0.7593269348144531
0 references
0.7494717836380005
0 references
0.7405763864517212
0 references
