| Title: | Many distances in planar graphs |
|---|
| Authors: | ID Cabello, Sergio (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/01089.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Abstract: | We show how to compute in ▫$O(n^{4/3} log^{1/3} n + n^{2/3}k^{2/3} log n)$▫ time the distance between $k$ given pairs of vertices of a planar graph $G$ with ▫$n$▫ vertices. This improves previous results whenever ▫$(n/log n)^{5/6} le k le n^2/log^6 n$▫. As an application, we speed up previous algorithms for computing the dilation of geometric planar graphs. |
|---|
| Keywords: | matematika, teorija grafov, ravninski graf, razdalja, mathematics, graph theory, planar graph, distance |
|---|
| Year of publishing: | 2009 |
|---|
| Number of pages: | str. 1-18 |
|---|
| Numbering: | Vol. 47, št. 1089 |
|---|
| PID: | 20.500.12556/DKUM-51785  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 15142233 |
|---|
| NUK URN: | URN:SI:UM:DK:HBH2ZYTR |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1799 |
|---|
| Downloads: | 86 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
