2283 search results - page 445 / 457 » Bounds of Graph Characteristics |
164
click to vote
DFG
2009
Springer
16 years 1 days ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
172
click to vote
FSTTCS
2009
Springer
16 years 1 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
178
click to vote
FOCS
2008
IEEE
15 years 12 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
274
click to vote
ICCCN
2008
IEEE
15 years 12 months ago
2008
IEEE
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
152
click to vote
INFOCOM
2008
IEEE
15 years 12 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...