103 search results - page 8 / 21 » Representations of graphs modulo n |
SASO
2008
IEEE
14 years 2 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
TALG
2008
13 years 7 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...