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)

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

Highly Cited

2005

Highly Cited

2005

- JosÃ© M. P. Nascimento, José M. Bioucas-Dias
- IEEE Transactions on Geoscience and Remoteâ€¦
- 2005

Given a set of mixed spectral (multispectral or hyperspectral) vectors, linear spectral mixture analysis, or linear unmixingâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons
- ALENEX/ANALC
- 2004

A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and comparedâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

ing Object Creation Everything we see and interact with in Lexi's user interface is aglyph composed in other, invisible glyphsâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
- STOC
- 2003

Given a <i>k</i>-uniform hyper-graph, the E<i>k</i>-Vertex-Cover problem is to find the smallest subset of vertices thatâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Erik Lindholm, Mark J. Kligard, Henry P. Moreton
- SIGGRAPH
- 2001

In this paper we describe the design, programming interface, and implementation of a very efficient user-programmable vertexâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Eran Halperin
- SODA
- 2000

1 I n t r o d u c t i o n Given a hypergraph H= (V,E), a ver tex cover of H is a set C C V such that for every e E E, thereâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Vineet Bafna, Piotr Berman, Toshihiro Fujito
- SIAM J. Discrete Math.
- 1999

A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Kok-Lim Low, Tiow Seng Tan
- SI3D
- 1997

This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. Itâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Jan Arne Telle, Andrzej Proskurowski
- SIAM J. Discrete Math.
- 1997

In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design forâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Donald J. Rose, Robert E. Tarjan
- STOC
- 1975

We consider a graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric andâ€¦Â (More)

Is this relevant?