Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Vertex (graph theory)

Known as: Node, Vertex, Node (graph) 
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
Party Problem: Find the minimum number R(k, l) of guests that must be invited so that at least k will know each other or at least… Expand
  • figure 1
Highly Cited
2016
Highly Cited
2016
Abstract Community detection in networks is one of the most popular topics of modern network science. Communities, or clusters… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Highly Cited
2009
Highly Cited
2009
Very high resolution satellite images provide valuable information to researchers. Among these, urban-area boundaries and… Expand
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Highly Cited
2007
Highly Cited
2007
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines… Expand
  • figure 1
  • figure 2
  • figure 8
  • figure 8
  • figure 9
Highly Cited
2006
Highly Cited
2006
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
Despite its increasing role in communication, the World-Wide Web remains uncontrolled: any individual or institution can create a… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 7.1
Highly Cited
1999
Highly Cited
1999
Large networks, having thousands of vertices and lines, can be found in many different areas, e. g: genealogies, flo w graphs of… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Highly Cited
1973
Highly Cited
1973
Main point Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the… Expand
  • figure 1
  • figure 2
Highly Cited
1965
Highly Cited
1965
An algorithm is described for optimally pamng a finit e set of objects. That is, given a real numerical weight for each unordered… Expand