84 search results - page 5 / 17 » Asymptotic enumeration of orientations |
DCG
2007
14 years 11 months ago
2007
COCOON
2009
Springer
15 years 2 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
DAM
2010
14 years 11 months ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
106
click to vote
SOFSEM
2000
Springer
15 years 2 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
JCB
2008
14 years 11 months ago
2008
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...