Algorithms for graphs of bounded treewidth via orthogonal range searching |
| |
Authors: | Sergio Cabello Christian Knauer |
| |
Institution: | aDepartment of Mathematics, IMFM, and Department of Mathematics, FMF, University of Ljubljana, Slovenia;bInstitut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany |
| |
Abstract: | We show that, for any fixed constant k3, the sum of the distances between all pairs of vertices of an abstract graph with n vertices and treewidth at most k can be computed in O(nlogk−1n) time.We also show that, for any fixed constant k2, the dilation of a geometric graph (i.e., a graph drawn in the plane with straight-line segments) with n vertices and treewidth at most k can be computed in O(nlogk+1n) expected time. The dilation (or stretch-factor) of a geometric graph is defined as the largest ratio, taken over all pairs of vertices, between the distance measured along the graph and the Euclidean distance.The algorithms for both problems are based on the same principle: data structures for orthogonal range searching in bounded dimension provide a compact representation of distances in abstract graphs of bounded treewidth. |
| |
Keywords: | Dilation Average distance Wiener index Treewidth Orthogonal range searching |
本文献已被 ScienceDirect 等数据库收录! |
|