67 search results - page 2 / 14 » Succinct Representations of Arbitrary Graphs |
FCT
2005
Springer
13 years 11 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
GD
2008
Springer
13 years 6 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
ICCAD
2008
IEEE
14 years 2 months ago
2008
IEEE
— In today’s complex SoC designs, verification and debugging are becoming ever more crucial and increasingly timeconsuming tasks. The prevalence of embedded memories adds to t...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...