103 search results - page 6 / 21 » Representations of graphs modulo n |
WG
2010
Springer
13 years 7 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...
DAM
2007
13 years 8 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
INFOCOM
2011
IEEE
13 years 4 days ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
GD
1998
Springer
14 years 28 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...