Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066)
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 7680318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving vertex cover in polynomial time on hyperbolic random graphs |
scientific article; zbMATH DE number 7680318 |
Statements
Solving vertex cover in polynomial time on hyperbolic random graphs (English)
0 references
27 April 2023
0 references
vertex cover
0 references
random graphs
0 references
hyperbolic geometry
0 references
efficient algorithm
0 references
1.0000002
0 references
0 references
0.9304724
0 references
0.92851293
0 references
0.9208423
0 references
0.91965604
0 references
0.90993124
0 references
