Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs (Q4629989)
From MaRDI portal
!
WARNING
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 7044623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs |
scientific article; zbMATH DE number 7044623 |
Statements
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs (English)
0 references
28 March 2019
0 references
planar graph
0 references
Voronoi diagram
0 references
Wiener index
0 references
diameter
0 references
distance counting
0 references
distances in graphs
0 references
0.9869507551193236
0 references
0.8536403179168701
0 references
0.852639377117157
0 references
0.8488315343856812
0 references
0.8450987935066223
0 references
