1423608
Hamiltonian Connected Claw-Free Graphs
Abstract.A well-known result by O. Ore is that every graph of order n with d(u)+d(v)≥n+1 for any pair of nonadjacent vertices u and v is hamiltonian connected (i.e., for every pair of vertices, there is a hamiltonian path joining them). In this paper, we show that every 3-connected claw-free graph G on at most 5δ−8 vertices is hamiltonian connected, where δ denotes the minimum degree in G. This result generalizes several previous results.
29060290
Hamiltonian Cycles in N2-Locally Connected Claw-Free Graphs
4909789
On Pancyclic Claw-Free Graphs
41518374
Longest cycles in regular 2-connected claw-free graphs
In this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min 4k?2, n (k?8), and this result is best possible.
5906681
Circumferences of 2-Connected Claw-Free Graphs
30829488
Vertex pancyclism in claw-free graphs
Abstract In this paper, we show four sufficient conditions for vertex pancyclicity in claw-free graphs. These results improve, respectively, results of Broersma and Veldman, Gould and Jacobson, and Ryjacek. In particular, we prove that if G is a 3-connected claw-free graph such that the vertices of degree 1 of every induced bull have a common neighbor in G then every vertex of G is contained in a cycle of all possible lengths except for four and five. We conjecture that almost all pancyclic claw-free graphs with minimum degree at least three are vertex pancyclic.
14969576
Semi-Supervised Regression with Co-Training
In many practical machine learning and data mining applications, unlabeled training examples are readily available but labeled ones are fairly expensive to obtain. Therefore, semi-supervised learning algorithms such as co-training have attracted much attention. Previous research mainly focuses on semi-supervised classification. In this paper, a co-training style semi-supervised regression algorithm, i.e. COREG, is proposed. This algorithm uses two k-nearest neighbor regressors with different distance metrics, each of which labels the unlabeled data for the other regressor where the labeling confidence is estimated through consulting the influence of the labeling of unlabeled examples on the labeled ones. Experiments show that COREG can effectively exploit unlabeled data to improve regression estimates.
3009418
The hamiltonian index of a graph and its branch-bonds
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian index of a graph $G$ with $h(G)\geq 2$ is given here. With it we will establish a sharp lower bound and a sharp upper bound for $h(G)$, respectively, which improves some known results of P.A. Catlin et al. [J. Graph Theory 14 (1990)] and H.-J. Lai [Discrete Mathematics 69 (1988)]. Examples show that $h(G)$ may reach all integers between the lower bound and the upper bound.
42842563
A WSRF Based Shopping Cart System
Web Services Resource Framework (WSRF) is a set of specifications that represents a convergence point of the Web services and the Grid services communities. This paper presents our early experience with WSRF. A shopping cart system has been implemented with WSRF supported Globus toolkit 3.9.2 (GT3.9.2). Based on the system, the performance of the WSRF core in GT3.9.2 has also been evaluated.
3605809
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
Minimizing total energy to keep an ad hoc wireless network symmetrically connected is an NP-hard problem. Recently, several greedy approximations have been proposed, based on k-restricted decompositions of the network. Their performance ratios are established through estimations of the least upper bound ρk for the ratio between total powers of best possible k-restricted decomposition and the optimal solution. In this paper, we determine the exact value of ρk for all k.
6156793
Optimum Robot Control for 3D Virtual Fixture in Constrained ENT Surgery
In ENT surgery, the operating volume is very limited. This is especially true in sinus surgery, when the instrument passes through the sinus cavity to reach the pathological area. The sinus bones impose geometric constraints on the work volume. During the surgery, the surgeon needs to take care of the motion of the instrument tip to accomplish some delicate procedure; meanwhile he/she needs to avoid hitting anatomic constraints. In this paper, we present a method to assist the path following task in a constrained area. We project instrument tip motion, boundary information on the joint displacement via robot kinematics, and then use a constrained quadratic optimization algorithm to compute the optimal set of corresponding joint displacements. In the preliminary study, we show that the optimization constrained control can avoid collision with geometric constraints on the work volume, while keeping the precision of the tool motion.