268 search results - page 16 / 54 » Growing Protean Graphs |
122
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
105
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
123
click to vote
GBRPR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
101
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
115
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...