307 search results - page 31 / 62 » Finite locally-quasiprimitive graphs |
CLASSIFICATION
2008
13 years 10 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
309
click to vote
Lecture Notes
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...
COMBINATORICS
2006
13 years 10 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...