Computing the maximum detour of a plane geometric graph in subquadratic time (Q2968072)
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 6693706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the maximum detour of a plane geometric graph in subquadratic time |
scientific article; zbMATH DE number 6693706 |
Statements
9 March 2017
0 references
COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME (English)
0 references
0.9773626923561096
0 references
0.8053247928619385
0 references
0.785270094871521
0 references
