# Vertex (geometry)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2019

Highly Cited

2019

- TOPC
- 2019

Natural graphs with skewed distributions raise unique challenges to distributed graph computation and partitioning. Existingâ€¦Â (More)

Is this relevant?

Highly Cited

2017

Highly Cited

2017

- ACL
- 2017

Network embedding (NE) is playing a critical role in network analysis, due to its ability to represent vertices with efficientâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- J. ACM
- 2010

Betweenness-Centrality measure is often used in social and computer communication networks to estimate the potential monitoringâ€¦Â (More)

Is this relevant?

2009

2009

- 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

- SIAM Review
- 2004

We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectivelyâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Information Theory
- 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)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- FOCS
- 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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- J. Algorithms
- 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

- 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

- 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?