271 search results - page 27 / 55 » Quasi-isometries between graphs and trees |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
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...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...