4137 search results - page 50 / 828 » On the number of matchings of a tree |
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
COMBINATORICS
2006
13 years 9 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
AAAI
2010
13 years 10 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
DAM
2007
13 years 9 months ago
2007
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...