21 search results - page 1 / 5 » wg 2010 |
WG
2010
Springer
13 years 2 months ago
2010
Springer
WG
2010
Springer
13 years 2 months ago
2010
Springer
WG
2010
Springer
13 years 2 months ago
2010
Springer
WG
2010
Springer
13 years 2 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...
WG
2010
Springer
13 years 2 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...