In geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex for each disk in the family, and with an edge between two vertices whenever the corresponding vertices lie within a unit distance of each other.
They are commonly formed from a Poisson point process, making them a simple example of a random structure.
geometric graph theory, a unitdiskgraph is the intersection graph of a family of unitdisks in the Euclidean plane. That is, it is a graph with one vertex...
are obtained if and only if the unitdisk is a regular hexagon or a parallelogram, respectively. UnitdiskgraphUnit sphere De Branges's theorem S. Golab...
may have different lengths. Every penny graph is a unitdiskgraph and a matchstick graph. Like planar graphs more generally, they obey the four color...
or polytope, unitdiskgraphs, and visibility graphs. Topics in this area include: Graph drawing Polyhedral graphs Random geometric graphs Voronoi diagrams...
permutation graph, in turn they are a special case of the family of the complements of comparability graphs known as cocomparability graphs. A unitdiskgraph is...
bandwidth allocation to radio stations, the resulting conflict graph is a unitdiskgraph, so the coloring problem is 3-approximable. A compiler is a computer...
dimensional unitdiskgraphs, it is possible to transform a set of points into their indifference graph, or a set of unit intervals into their unit interval...
geometric graph. For instance, the intersection graph of line segments in one dimension is an interval graph; the intersection graph of unitdisks in the...
delivery in the so-called unitdiskgraph network model. Various variants, which were proposed later , also for non-unitdiskgraphs, are based on the principles...
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting...
can be found by applying the permutation graph algorithm to each neighborhood. Similarly, in a unitdiskgraph (with a known geometric representation)...
metric space is a special case of a clique complex, formed from the unitdiskgraph of the points; however, every clique complex X(G) may be interpreted...
Disk Utility is a system utility for performing disk and disk volume-related tasks on the macOS operating system by Apple Inc. The functions currently...
representing a graph as a unitdiskgraph may require exponentially many bits for the coordinates of the disk centers. Low-dimensional comparability graphs The comparability...
of disks of different sizes, placed in increasing order of size on a fixed set of towers. The Hanoi graph for a puzzle with n {\displaystyle n} disks on...
plane, that certain graphs including the polyhedral graphs have greedy embeddings in the Euclidean plane, and that unitdiskgraphs have greedy embeddings...
Double-stranded uracil-DNA glycosylase, an enzyme Ultra diffuse galaxy Unitdiskgraph from geometric graph theory udg, the ISO 639-3 code for the Muduga language UDG...
B.; Ravi, S. S.; Rosenkrantz, D. J. (1995). "Simple heuristics for unitdiskgraphs". Networks. 25 (2): 59. arXiv:math/9409226. doi:10.1002/net.3230250205...
measurement a base unit for length is chosen, from which all other units are derived. In the International System of Units (SI) system the base unit for length...
special cases such as unitdiskgraphs and planar graphs. A minimum dominating set can be found in linear time in series–parallel graphs. A minimum dominating...
approximation ratio is 2. On unitdiskgraphs its approximation ratio is 3. The triangular prism is the smallest graph for which one of its degeneracy...
the sensor disks as possible. By applying Menger's theorem to the unitdiskgraph defined from the barriers, this minimal number of disks can be shown...