Computing graph hyperbolicity using dominating sets (Q6543129)
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: Computing graph hyperbolicity using dominating sets |
scientific article; zbMATH DE number 7852730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing graph hyperbolicity using dominating sets |
scientific article; zbMATH DE number 7852730 |
Statements
Computing graph hyperbolicity using dominating sets (English)
0 references
24 May 2024
0 references
Gromov hyperbolicity
0 references
graph algorithms
0 references
algorithm engineering
0 references
0.8360579609870911
0 references
0.8255195021629333
0 references
0.8248013257980347
0 references
0.8193886280059814
0 references
0.8168179392814636
0 references
