16 search results - page 1 / 4 » Tutte sets in graphs II: The complexity of finding maximum T... |
DAM
2007
14 years 10 months ago
2007
COMBINATORICS
1999
14 years 10 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...
88
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
JGAA
2006
14 years 10 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
NIPS
2003
14 years 12 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...