2430 search results - page 153 / 486 » Computing Tutte Polynomials |
146
click to vote
CPC
2006
15 years 4 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
JSC
2007
15 years 4 months ago
2007
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
138
Voted
IPL
2002
15 years 4 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
128
click to vote
ECCC
1998
15 years 4 months ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
123
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
We describe two direct quasilinear methods for camera pose (absolute orientation) and calibration from a single image of 4 or 5 known 3D points. They generalize the 6 point `Direc...