SODA
2012
ACM
12 years 1 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
IMCSIT
2010
13 years 9 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
WG
2010
Springer
13 years 9 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
DM
2008
13 years 11 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
APPROX
2006
Springer
14 years 3 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
PODC
2005
ACM
14 years 5 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...