22 search results - page 4 / 5 » The Jones polynomial and graphs on surfaces |
311
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
161
click to vote
JAT
2010
15 years 4 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
156
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
151
click to vote
COMBINATORICS
1999
15 years 5 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
172
click to vote
STACS
2007
Springer
16 years 4 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...