Sciweavers

151 search results - page 2 / 31
» The Computational Complexity of Knot and Link Problems
Sort
View
VISUALIZATION
2005
IEEE
13 years 11 months ago
Visualizing the tightening of knots
The study of physical models for knots has recently received much interest in the mathematics community. In this paper, we consider the ropelength model, which considers knots tie...
Jason Cantarella, Michael Piatek, Eric Rawdon
CGF
2008
130views more  CGF 2008»
13 years 5 months ago
An Adaptive Contact Model for the Robust Simulation of Knots
In this paper, we present an adaptive model for dynamically deforming hyper-elastic rods. In contrast to existing approaches, adaptively introduced control points are not governed...
Jonas Spillmann, Matthias Teschner
ACL
2010
13 years 3 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
COCOON
2008
Springer
13 years 7 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
EM
2010
155views Management» more  EM 2010»
13 years 5 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...