Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
Cabello, Sergio
In this article, we show how to compute for ▫$n$▫-vertex planar graphs in ▫$O(n^{11/6} \text{polylog}(n))$▫ expected time the diameter and the sum of the pairwise distances. The algorithms work for ...directed graphs with real weights and no negative cycles. In ▫$O(n^{15/8} \text{polylog}(n))$▫ expected time, we can also compute the number of pairs of vertices at distances smaller than a given threshold. These are the first algorithms for these problems using time ▫$O(n^c)$▫ for some constant ▫$c< 2$▫, even when restricted to undirected, unweighted planar graphs.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
