1629 search results - page 150 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
AINA
2006
IEEE
15 years 1 months ago
2006
IEEE
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
76
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
JSAC
2006
14 years 10 months ago
2006
A game-theoretic model for studying power control in multicarrier code-division multiple-access systems is proposed. Power control is modeled as a noncooperative game in which each...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
100
Voted
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...