6775901
Hamiltonicity of 3-connected quasi-claw-free graphs
A graph G is called quasi-claw-free if it satisfies the property: d(x,y)[email protected]? there exists [email protected]?N(x)@?N(y) such that N[u]@?N[x]@?N[y]. Let G be a 3-connected quasi-claw-free graph of order n. If @d(G)>=(n+5)/5, then G is hamiltonian.
30689406
Some hamiltonian properties of L1-graphs
Abstract A graph G is called an L 1 -graph if, for each triple of vertices u, v, and w with d ( u , v )=2 and w ∈ N ( u )∩ N ( v ), d ( u )+ d ( v )⩾| N ( u )∪ N ( v )∪ N ( w )|−1. Let G be a 2-connected L 1 -graph of order n. If δ ( G )⩾( n −2)/3 or σ 3 ( G )⩾ n , then G is hamiltonian or G∈ K , where σ 3 (G)= min {d(u)+d(v)+d(w) : {u,v,w} is an independent set in G }, K ={G : K p,p+1 ⊆G⊆K p +(p+1)K 1 for some p ⩾2}. Some results on the traceability of L 1 -graphs are also obtained.
41530847
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs
38366889
Hamiltonicity of 2-connected quasi-claw-free graphs
A graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2 ⇒ there exists u∈N(x)∩N(y) such that N[u]⊆N[x]∪N[y]. Let G be a 2-connected quasi-claw-free graph of order n. If δ(G)⩾n/4, then G is hamiltonian or G∈F, where F is a family of nonhamiltonian graphs of connectivity 2.
37590359
A Fan-type condition for claw-free graphs to be Hamiltonian
Abstract Let G be a 2 -connected claw-free graph of order n . If for each pair of vertices u and v dist (u,v)=3⇒ max (d(u),d(v))⩾(n−4)/2, then G is Hamiltonian.
27953110
Every 3-connected distance claw-free graph is Hamilton-connected
A graph G is said to be distance claw-free (in DC) if for each vertex v in V(G) the independence number of the subgraph of G induced by the set of vertices at distance i from v is at most 2 for each i>=0. It is shown that every 3-connected graph in DC is hamilton-connected, answering affirmatively a question of Shepherd.
11775748
Schema Mapping for Interoperability in XML-based multidatabase
The main aim of a multidatabase system (MDBS) is to achieve data integration and interoperability among distributed and heterogeneous database systems. But data model heterogeneity and schema make this a challenging task. Multidatabase users can only view the global schemas whose real data come from local database systems. Thus, mappings from global schemas to local schemas should be established. At the same time, the recent emergence of XML has shown great intractability as a new standard for data representation and exchange on the Web. A data model based on XML becomes more suitable for integrating different types of systems. This paper firstly introduces a multidatabase common data model based on XML, named XML-based Integration Model (XIDM). Then, an approach of schema mappings based on XIDM in MDBSs has been presented. Finally, the illustration and implementation of schema mappings in a multidatabase prototype - Panorama are also discussed.
2080269
Testing multivariate uniformity and its applications
Some new statistics are proposed to test the uniformity of random samples in the multidimensional unit cube [0, 1] d (d ≥ 2). These statistics are derived from number-theoretic or quasi-Monte Carlo methods for measuring the discrepancy of points in [0,1] d Under the null hypothesis that the samples are independent and identically distributed with a uniform distribution in [0,1] d , we captain some asymptotic properties of the new statistics. By Monte Carlo simulation, it is found that the finite-sample distributions of the new statistics are well approximated by the standard normal distribution, N(0,1), or the chi-squared distribution, X 2 (2). A power study is performed, and possible applications of the new statistics to testing general multivariate goodness-of-fit problems are discussed.
17885452
Commutativity-based concurrency control in groupware
Commutativity of operations is often exploited in concurrent systems to attain high levels of concurrency. A commutativity-based concurrency control method, called operational transformation (OT), has been actively researched in groupware over the past 15 years. However, much progress can still be made on more practicable approaches to developing and proving OT algorithms. Several constraints have been proposed previously but they are generally difficult to follow and verify in practice. This paper proposes an alternative approach to address this problem. A new consistency model is defined which greatly simplifies the design and proof of OT algorithms
34397649
Architecture support of a descriptor computer on object-orientation
2700551
Combining Front Propagation with Shape Knowledge for Accurate Curvilinear Modelling
In this paper, we propose an approach to accurately modelling tubular, anatomical structures as curvilinear entities. Current optimal path and centerline extraction techniques are either prone to introducing spurious tortuosity, or unable to consistently avoid taking shortcuts at high curvature positions. These problems not only affect spatial appreciation of the structure but may also significantly impact the accuracy of length, angle and tortuosity measurements. Our approach overcomes the above deficiencies through the combination of a front propagation method and a model in which a priori shape knowledge is embedded. This approach is designed to be used in endovascular and neurological surgical planning. The efficacy of our method is demonstrated using synthetic and clinical data.