Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598)
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: Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications |
scientific article |
Statements
Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (English)
0 references
6 April 2018
0 references
Gromov hyperbolicity
0 references
node expansion
0 references
minimum cuts
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0.7650111317634583
0 references
0.7628768086433411
0 references
0.7615982294082642
0 references
0.7601458430290222
0 references
0.7571738362312317
0 references
