Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality (Q6072209)
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 7749686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality |
scientific article; zbMATH DE number 7749686 |
Statements
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality (English)
0 references
12 October 2023
0 references
graph algorithms
0 references
subgraph enumeration
0 references
connected induced subgraphs
0 references
reverse search
0 references
0 references
0.9303091168403624
0 references
0.9259564876556396
0 references
0.8856992721557617
0 references
0.7877234816551208
0 references
0.7831602692604065
0 references
