168 search results - page 34 / 34 » New upper bounds on the decomposability of planar graphs |
126
Voted
CPM
2004
Springer
15 years 2 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...
95
Voted
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
115
click to vote
CCA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...