35 search results - page 3 / 7 » On the interlace polynomials of forests |
JCT
2002
14 years 9 months ago
2002
This paper presents a systematic approach to the discovery, interpretation and veri cation of various extensions of Hurwitz's multinomial identities, involving polynomials de...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
JCAM
2010
14 years 4 months ago
2010
Abstract. We investigate the properties of extremal point systems on the real line consisting of two interlaced sets of points solving a modified minimum energy problem. We show th...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
102
click to vote
ACL
1990
14 years 10 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...