• Thumbnail for Relative neighborhood graph
    In computational geometry, the relative neighborhood graph (RNG) is an undirected graph defined on a set of points in the Euclidean plane by connecting...
    7 KB (685 words) - 16:08, 7 December 2024
  • Thumbnail for Euclidean minimum spanning tree
    Euclidean minimum spanning tree (category Geometric graphs)
    geometric graphs including the relative neighborhood graph and Delaunay triangulation. By constructing the Delaunay triangulation and then applying a graph minimum...
    55 KB (6,676 words) - 19:53, 5 February 2025
  • Thumbnail for Urquhart graph
    the Urquhart graph as well. Although it was later shown that the Urquhart graph is not exactly the same as the relative neighborhood graph, it can be used...
    3 KB (354 words) - 16:23, 7 December 2024
  • Thumbnail for Gabriel graph
    subgraphs, the Euclidean minimum spanning tree, the relative neighborhood graph, and the nearest neighbor graph. It is an instance of a beta-skeleton. Like beta-skeletons...
    5 KB (506 words) - 01:32, 10 June 2023
  • Rng or RNG may refer to: Random number generation Relative neighborhood graph, an undirected graph used in computational geometry RELAX NG, an XML schema...
    981 bytes (153 words) - 22:40, 21 March 2025
  • paper by Toussaint, in which he introduced the concept of a relative neighborhood graph. Locality sensitive hashing (LSH) is a technique for grouping...
    27 KB (3,341 words) - 05:28, 22 June 2025
  • Thumbnail for Unit distance graph
    three-dimensional relative neighborhood graphs. In four or more dimensions, any complete bipartite graph is a unit distance graph, realized by placing...
    33 KB (4,022 words) - 23:01, 23 June 2025
  • Thumbnail for Spatial network
    spanning tree, or the generalization, the Steiner tree and the relative neighborhood graph. In the "real" world, many aspects of networks are not deterministic...
    10 KB (1,111 words) - 06:01, 12 April 2025
  • Thumbnail for Godfried Toussaint
    value linear in the size of the input. In 1980 he introduced the relative neighborhood graph (RNG) to the fields of pattern recognition and machine learning...
    10 KB (1,217 words) - 06:40, 27 September 2024
  • Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
    109 KB (16,011 words) - 18:32, 30 April 2025
  • Thumbnail for Beta skeleton
    Beta skeleton (category Geometric graphs)
    of other input points. For this alternative definition, the relative neighborhood graph is a special case of a β-skeleton with β = 2. The two definitions...
    16 KB (1,887 words) - 06:24, 11 March 2024
  • Thumbnail for Percolation threshold
    Percolation threshold (category Random graphs)
    Oliver (2013). "Percolation thresholds on planar Euclidean relative-neighborhood graphs". Physical Review E. 87 (4): 042106. arXiv:1301.6967. Bibcode:2013PhRvE...
    239 KB (15,635 words) - 18:07, 9 June 2025
  • Thumbnail for Centrality
    In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position...
    47 KB (6,738 words) - 13:09, 11 March 2025
  • Thumbnail for Saddle point
    function (whose graph is a curve, surface or hypersurface) is a stationary point such that the curve/surface/etc. in the neighborhood of that point is...
    9 KB (1,030 words) - 11:03, 15 April 2025
  • Thumbnail for Implicit graph
    separations for non-relativized models. For instance, Childs et al. used neighborhood representations of implicit graphs to define a graph traversal problem...
    23 KB (2,839 words) - 17:41, 20 March 2025
  • Thumbnail for Erdős–Rényi model
    mathematical field of graph theory, the Erdős–Rényi model refers to one of two closely related models for generating random graphs or the evolution of a...
    19 KB (2,795 words) - 05:56, 9 April 2025
  • graph (GG), Relative neighborhood graph (RNG), Voronoi diagram Spanning Tree Based: LMST, iMST Direction Based: Yao graph and Nearest neighbor graph,...
    10 KB (1,164 words) - 22:12, 25 November 2024
  • Thumbnail for Exponential family random graph models
    Exponential family random graph models (ERGMs) are a set of statistical models used to study the structure and patterns within networks, such as those...
    24 KB (3,620 words) - 05:11, 5 June 2025
  • Implicit graph representation". Efficient Graph Representations. American Mathematical Soc. pp. 17–30. ISBN 978-0-8218-2815-1.. "Seymour's 2nd Neighborhood Conjecture"...
    195 KB (20,069 words) - 07:07, 11 June 2025
  • Thumbnail for Intersection number (graph theory)
    In the mathematical field of graph theory, the intersection number of a graph G = ( V , E ) {\displaystyle G=(V,E)} is the smallest number of elements...
    35 KB (4,363 words) - 13:40, 25 February 2025
  • Thumbnail for Scale-free network
    transformation which converts random graphs to their edge-dual graphs (or line graphs) produces an ensemble of graphs with nearly the same degree distribution...
    47 KB (6,015 words) - 00:15, 6 June 2025
  • Thumbnail for Katz centrality
    Katz centrality (category Graph invariants)
    In graph theory, the Katz centrality or alpha centrality of a node is a measure of centrality in a network. It was introduced by Leo Katz in 1953 and...
    13 KB (1,910 words) - 09:35, 6 April 2025
  • Thumbnail for Poverty threshold
    Relative poverty means low income relative to others in a country: for example, below 60% of the median income of people in that country. Relative poverty...
    62 KB (7,167 words) - 17:12, 25 June 2025
  • Thumbnail for Spectral clustering
    Spectral clustering (category Algebraic graph theory)
    spectral version of DBSCAN, especially in sparse graphs or when constructing ε-neighborhood graphs. While DBSCAN operates directly in the data space...
    27 KB (3,562 words) - 02:56, 14 May 2025
  • Thumbnail for Network homophily
    decentralized). Although the size of clusters might affect the magnitude of relative homophily. A higher level of homophily can be associated to a more convex...
    7 KB (1,082 words) - 11:44, 13 September 2024
  • Thumbnail for Diamond cubic
    Diamond cubic (category Infinite graphs)
    involves the removal of some of the edges from a three-dimensional grid graph. In this coordinatization, which has a distorted geometry from the standard...
    12 KB (1,491 words) - 06:09, 6 November 2024
  • list, see abundance of elements in Earth's crust. The graph at right illustrates the relative atomic-abundance of the chemical elements in Earth's upper...
    42 KB (4,386 words) - 20:20, 18 June 2025
  • Thumbnail for Bay Ridge, Brooklyn
    Bay Ridge, Brooklyn (category Neighborhoods in Brooklyn)
    Bay Ridge is a neighborhood in the southwest corner of the New York City borough of Brooklyn. It is bounded by Sunset Park to the north, Dyker Heights...
    142 KB (12,056 words) - 16:46, 25 May 2025
  • Thumbnail for Small-world network
    network example Hubs are bigger than other nodes A small-world network is a graph characterized by a high clustering coefficient and low distances. In an...
    38 KB (4,646 words) - 17:23, 9 June 2025
  • Thumbnail for Network theory
    Network theory (category Graph theory)
    science, and network science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges possess attributes. Network...
    35 KB (3,959 words) - 04:41, 15 June 2025