11381 search results - page 326 / 2277 » Connectivity |
186
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
This paper answers the following question: Given an \erector set" linkage, a connected set of xed-length links, what is the minimal needed to adjust the edge lengths so that ...
182
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
200
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
165
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
118
click to vote
ICMS
2010
15 years 5 months ago
2010
We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle...