2430 search results - page 304 / 486 » Computing Tutte Polynomials |
102
Voted
CGF
2008
15 years 3 months ago
2008
We present a second order smooth filling of an n-valent Catmull-Clark spline ring with n biseptic patches. While an underdetermined biseptic solution to this problem has appeared ...
101
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
118
Voted
COR
2008
15 years 3 months ago
2008
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
58
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
93
Voted
DAM
2010
15 years 3 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...