Sciweavers

36781 search results - page 276 / 7357
» Parameterizing by the Number of Numbers
Sort
View
SIAMDM
2010
133views more  SIAMDM 2010»
15 years 4 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul
WG
2010
Springer
15 years 4 months ago
The Number of Bits Needed to Represent a Unit Disk Graph
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...
Colin McDiarmid, Tobias Müller