446 search results - page 21 / 90 » A Combinatorial Theorem for Trees |
117
Voted
CPC
2006
15 years 1 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
111
click to vote
MFCS
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
121
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
122
click to vote
PDCN
2004
15 years 3 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
130
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...