Using edge cuts to find Euler tours and Euler families in hypergraphs (Q6172287)
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 7714267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using edge cuts to find Euler tours and Euler families in hypergraphs |
scientific article; zbMATH DE number 7714267 |
Statements
Using edge cuts to find Euler tours and Euler families in hypergraphs (English)
0 references
19 July 2023
0 references
Euler tour
0 references
Euler family
0 references
edge cut
0 references
edge cut assignment
0 references
collapsed hypergraph
0 references
0.9213117361068726
0 references
0.886488676071167
0 references
0.8423426747322083
0 references
0.8259755969047546
0 references
0.8245498538017273
0 references
