Name
Abstract | ||
|---|---|---|
Given a set of points in the plane, we want to establish a connected spanning graph between these points, called connection network, that consists of several disjoint layers. Motivated by sensor networks, our goal is that each layer is connected, spanning, and plane. No edge in this connection network is too long in comparison to the length needed to obtain a spanning tree. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.comgeo.2019.04.001 | Computational Geometry |
Keywords | Field | DocType |
Geometric graphs,Graph packing,Plane graphs,Minimum spanning tree,Bottleneck edge | Graph,Discrete mathematics,Combinatorics,Distributed element model,Disjoint sets,Vertex (geometry),Spanning tree,Wireless sensor network,Mathematics | Journal |
Volume | ISSN | Citations |
82 | 0925-7721 | 0 |
PageRank | References | Authors |
0.34 | 0 | 8 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oswin Aichholzer | 1 | 852 | 96.04 |
| Thomas Hackl | 2 | 138 | 22.95 |
| Matias Korman | 3 | 178 | 37.28 |
| Alexander Pilz | 4 | 59 | 17.67 |
| Günter Rote | 5 | 1181 | 129.29 |
| André van Renssen | 6 | 3 | 4.74 |
| Marcel Roeloffzen | 7 | 18 | 5.55 |
| Birgit Vogtenhuber | 8 | 127 | 27.19 |