446 search results - page 47 / 90 » A Combinatorial Theorem for Trees |
CG
2002
Springer
14 years 11 months ago
2002
Springer
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...
SLOGICA
2010
14 years 10 months ago
2010
Abstract. For a first-order formula ϕ(x; y) we introduce and study the characteristic sequence Pn : n < ω of hypergraphs defined by Pn(y1, . . . , yn) := (∃x) i≤n ϕ(x; ...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
AUSDM
2007
Springer
15 years 6 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
111
click to vote
ESA
1998
Springer
15 years 4 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...