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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Graph matching, which refers to a class of computational problems of finding an optimal correspondence between the vertices of… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Understanding complex systems often requires a bottom-up analysis towards a systems biology approach. The need to investigate a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The computational challenge posed by NP-hard problems has inspired the development of a wide range of algorithmic techniques. Due… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized… (More)
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Let G be a graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then L(G) D(G) A(G… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A graph G = (V,E) is a set V of vertices and a set E of edges, in which an edge joins a pair of vertices. 1 Normally, graphs are… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?