Skip to search formSkip to main content
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
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many… Expand
  • figure 1
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
1999
Highly Cited
1999
For each commutative ring R we associate a (simple) graph Γ(R). We investigate the interplay between the ring-theoretic… Expand
  • table 1
  • table 2
  • table 3
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A battery powered regenerative drive system having a time ratio controlled regenerative chopper circuit for regulating electrical… Expand
  • figure 1
  • figure 2
Is this relevant?
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
Is this relevant?