Sciweavers

4 search results - page 1 / 1
» Universal graphs with a forbidden subtree
Sort
View
JCT
2007
84views more  JCT 2007»
13 years 8 months ago
Universal graphs with a forbidden subtree
Gregory L. Cherlin, Saharon Shelah
EJC
2010
13 years 8 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
INFOCOM
2007
IEEE
14 years 2 months ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
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...
Ritesh Maheshwari, Jie Gao, Samir R. Das
CACM
1998
110views more  CACM 1998»
13 years 8 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon