522 search results - page 15 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
101
click to vote
ENTER
2009
Springer
15 years 7 months ago
2009
Springer
Hyperlinks are the essence of the World Wide Web. Their importance is very high due to their ability to provide a visitor with a wealth of good quality information and for the rol...
203
Voted
IWPEC
2010
Springer
15 years 21 days ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
161
Voted
EEF
2000
15 years 6 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
131
Voted
INFOCOM
1997
IEEE
15 years 7 months ago
1997
IEEE
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
141
Voted
STACS
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...