1101 search results - page 141 / 221 » An Algorithm for the Graph Crossing Number Problem |
112
Voted
WG
2005
Springer
15 years 8 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
145
Voted
IMCSIT
2010
15 years 16 days ago
2010
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
138
Voted
PAMI
2006
15 years 2 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
141
click to vote
IWCMC
2009
ACM
15 years 7 months ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
148
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...