A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs (Q2037960)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs |
scientific article; zbMATH DE number 7369997
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs |
scientific article; zbMATH DE number 7369997 |
Statements
A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs (English)
0 references
8 July 2021
0 references
enumeration algorithm
0 references
2-edge-connected induced subgraph
0 references
reverse search
0 references
polynomial delay
0 references
0.9539579
0 references
0.94973975
0 references
0.91028935
0 references
0.91028935
0 references
0.89899814
0 references
0.8898835
0 references
0.88979614
0 references
0.8843671
0 references
0.8826816
0 references
