Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680)
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 7572280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster connectivity in low-rank hypergraphs via expander decomposition |
scientific article; zbMATH DE number 7572280 |
Statements
Faster connectivity in low-rank hypergraphs via expander decomposition (English)
0 references
16 August 2022
0 references
hypergraphs
0 references
connectivity
0 references
expander decomposition
0 references
0 references
0 references
0 references
0.8258488774299622
0 references
0.8098077774047852
0 references
0.7848809957504272
0 references
0.7765569686889648
0 references
0.7740239500999451
0 references
