Vertex (geometry)

Known as: Mouth (mathematics), Geometric vertex, Vertex 
In geometry, a vertex (plural: vertices or vertexes) is a point where two or more curves, lines, or edges meet. As a consequence of this definition… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Natural graphs with skewed distributions raise unique challenges to distributed graph computation and partitioning. Existing… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2017
Highly Cited
2017
Network embedding (NE) is playing a critical role in network analysis, due to its ability to represent vertices with efficient… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Betweenness-Centrality measure is often used in social and computer communication networks to estimate the potential monitoring… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
  • Allen Knutson, Ezra Miller, Alexander Yong
  • 2009
We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively… (More)
  • figure 1.1
  • figure 1.2
  • figure 5.1
  • figure 7.1
  • table 7.1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We investigate a new class of codes for the optimal covering of vertices in an undirected graphG such that any vertex in G can be… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • table III
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper we give a 3-approximationalgorithm for the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our… (More)
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph under a sequence of requests… (More)
Is this relevant?
Highly Cited
1964
Highly Cited
1964
  • P. Erdös
  • 1964
An r-graph is a graph whose basic elements are its vertices and r-tuples . It is proved that to every 1 and r there is an e(l, r… (More)
Is this relevant?
Highly Cited
1963
Highly Cited
1963
  • P. Erdös
  • 1963
Denote by G(n; m) a graph of n vertices and m edges. We prove that every G(n; [n2/4] -t I) contains a circuit of 2 edges for… (More)
Is this relevant?