446 search results - page 64 / 90 » A Combinatorial Theorem for Trees |
165
click to vote
WAE
2001
15 years 1 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
117
click to vote
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
195
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
BMCBI
2005
14 years 11 months ago
2005
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
103
click to vote
STOC
2004
ACM
16 years 3 days ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...