29 search results - page 2 / 6 » Expanders are universal for the class of all spanning trees |
DM
2006
13 years 7 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
EJC
2010
13 years 7 months ago
2010
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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
MOR
2010
13 years 5 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...