103 search results - page 4 / 21 » Representations of graphs modulo n |
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
75
Voted
FSE
2004
Springer
15 years 1 months ago
2004
Springer
We study the differential probability adp of exclusive-or when differences are expressed using addition modulo 2N . This function is important when analysing symmetric primitives t...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
85
Voted
GD
2008
Springer
14 years 10 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
DCC
2011
IEEE
14 years 4 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...