#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2006

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Linfan Mao, Yanpei Liu, Erling Wei
- Graphs and Combinatorics
- 2006

- Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, Erling Wei
- Graphs and Combinatorics
- 2013

Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and Interconnection Networks, 2009). For a graph G and an integer s > 0 and for u, v ∈ V (G) with u = v, an (s; u, v)-path-system of G is a subgraph H consisting of s internally disjoint (u, v)-paths. A graph G is spanning… (More)

- Erling Wei, Jiayong Yan, Mantao Xu, Jiwu Zhang
- ICPR
- 2008

Segmentation of pulmonary nodules in chest radiographs is a difficult task due to heavy noise and superposition of ribs, vessels, and other anatomical structures in lung field. In this paper, a polynomial fitting based ray-casting algorithm is proposed for pulmonary nodule segmentation in chest radiographs. Instead of directly detecting nodule edge points,… (More)

- Ronald J. Gould, Wenliang Tang, Erling Wei, Cun-Quan Zhang
- Discrete Mathematics
- 2012

- Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai
- Discrete Math., Alg. and Appl.
- 2011

Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A * = A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V (G) → A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) → A * such that for each vertex v ∈ V (G), the total amount of f values on the edges directed out from v… (More)

- Erling Wei, Yanpei Liu, Zhaoxiang Li
- 2009

The lower and upper bounds on the decycling number of circular graph C(n, k) where k ≤ ⌊ n 2 ⌋ of order n are obtained. The explicit expressions of that of some classes of graphs are presented.

- Jinghua He, Erling Wei, Dong Ye, Shaohui Zhai
- ArXiv
- 2017

Let G be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset X of G is feasible if there exists two perfect matchings M1 and M2 such that |M1∩X| ≡ |M2∩X| (mod 2). Lukot'ka and Rollová proved that an edge subset X of a regular bipartite graph is not feasible if and only if X is switching-equivalent to ∅, and they… (More)

- Erling Wei, Yanpei Liu
- J. Systems Science & Complexity
- 2006

- Su Yang, Erling Wei, Ruimin Guan, Xinfeng Zhang, Jin Qin, Yuanyuan Wang
- Neurocomputing
- 2013

- Su Yang, Erling Wei, Yuanyuan Wang
- 2011 Sixth International Conference on Image and…
- 2011

We propose a local descriptor referred to as triangle chain code as well as a matching algorithm for point set matching and image registration. First, feature points are detected using Harris corner detector. Second, triangle chain code is constructed for every point, which carries the discriminative information regarding its k nearest neighbors (KNN).… (More)