Name
Abstract | ||
|---|---|---|
We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a label and a routing table for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node q and the routing table of the current node. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.comgeo.2019.101593 | Computational Geometry |
Keywords | Field | DocType |
Routing scheme,Polygonal domain | Discrete mathematics,Polygon,Combinatorics,Visibility graph,Vertex (geometry),Shortest path problem,Network packet,Routing table,Mathematics | Journal |
Volume | ISSN | Citations |
87 | 0925-7721 | 0 |
PageRank | References | Authors |
0.34 | 0 | 10 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bahareh Banyassady | 1 | 5 | 2.48 |
| Man-Kwun Chiu | 2 | 14 | 6.13 |
| Matias Korman | 3 | 178 | 37.28 |
| Wolfgang Mulzer | 4 | 257 | 36.08 |
| André van Renssen | 5 | 104 | 19.30 |
| Marcel Roeloffzen | 6 | 18 | 5.55 |
| Paul Seiferth | 7 | 9 | 5.17 |
| Yannik Stein | 8 | 10 | 3.35 |
| Birgit Vogtenhuber | 9 | 127 | 27.19 |
| Max Willert | 10 | 1 | 2.74 |