2430 search results - page 154 / 486 » Computing Tutte Polynomials |
132
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
129
click to vote
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
177
click to vote
DIS
2007
Springer
15 years 8 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
118
click to vote
ISMB
2001
15 years 6 months ago
2001
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
143
click to vote
CAD
2006
Springer
15 years 4 months ago
2006
Springer
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...