376 search results - page 22 / 76 » Completely connected clustered graphs |
EJC
2010
13 years 7 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
JGT
2008
13 years 7 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...