2430 search results - page 207 / 486 » Computing Tutte Polynomials |
143
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
127
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
141
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
150
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
123
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...