3204 search results - page 249 / 641 » The Alcuin Number of a Graph |
211
click to vote
MOBICOM
2006
ACM
16 years 18 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
173
click to vote
SIGECOM
2006
ACM
16 years 17 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
156
click to vote
INFOCOM
2005
IEEE
16 years 6 days ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
263
click to vote
FCA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
164
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...