223 search results - page 30 / 45 » A Note on Graph Pebbling |
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
ISVD
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...
GD
2001
Springer
14 years 3 days ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...