1055 search results - page 101 / 211 » Enumerations in computable structure theory |
128
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
127
click to vote
GG
2004
Springer
15 years 9 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
126
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
131
click to vote
ISMB
1998
15 years 5 months ago
1998
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...
142
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...