# Vertex (graph theory)

## Papers overview

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

Review

2016

Review

2016

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

- BioData Mining
- 2010

Understanding complex systems often requires a bottom-up analysis towards a systems biology approach. The need to investigate aâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- IEEE Transactions on Geoscience and Remoteâ€¦
- 2009

Very high resolution satellite images provide valuable information to researchers. Among these, urban-area boundaries andâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Physical review. E, Statistical, nonlinear, andâ€¦
- 2006

We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on theâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ALENEX/ANALC
- 2004

The computational challenge posed by NP-hard problems has inspired the development of a wide range of algorithmic techniques. Dueâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ICML
- 2004

A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clusteringâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Graduate texts in mathematics
- 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

- Algorithmica
- 2001

We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomizedâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- SIAM J. Discrete Math.
- 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)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Softw., Pract. Exper.
- 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)

Is this relevant?