316 search results - page 56 / 64 » The chromatic covering number of a graph |
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
AHSWN
2008
13 years 7 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
IV
2008
IEEE
14 years 1 months ago
2008
IEEE
There is a large number of interactive visualization tools, however no universal tool exists that covers all relevant aspects for all possible application domains. We have develop...