2430 search results - page 91 / 486 » Computing Tutte Polynomials |
160
Voted
ALGORITHMICA
2010
15 years 1 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
134
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
112
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
116
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
129
Voted
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...