#### Filter Results:

#### Publication Year

2006

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Though mutation testing has been widely studied for more than thirty years, the prevalence and properties of equivalent mutants remain largely unknown. We report on the causes and prevalence of equivalent mutants and their relationship to stubborn mutants (those that remain undetected by a high quality test suite, yet are non-equivalent). Our results, based… (More)

Let G be a 2-edge-connected simple graph on n ≥ 13 vertices and A an (additive) abelian group with |A| ≥ 4. In this paper, we prove that if for every uv ∈ E(G), max{d(u), d(v)} ≥ n/4, then either G is A-connected or G can be reduced to one of K 2,3 , C 4 and C 5 by repeatedly contracting proper A-connected subgraphs, where C k is a cycle of length k. We… (More)

Let G be an 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 at each vertex v ∈ V (G), the amount of f values on the edges directed out from v minus the amount of f… (More)

The application of genetic algorithms in automatically generating test data has become a research hotspot and produced many results in recent years. However, its applicability is limited in the presence of flag variables. This issue, known as the flag problem, has been studied by many researchers to date. We propose a novel method of testability… (More)

- Xiangjuan Yao, Dunwei Gong
- 2007

Let G be an 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 e∈E + (v) f (e) − e∈E − (v) f (e) = b(v). For an abelian group A, let A be the family of graphs that are… (More)

Erratum Erratum to " Collapsible biclaw-free graphs " There are two errors in the paper [2]. Firstly, Lemma 2.5 of [2] was incorrectly stated. The correct version of it is: Lemma 2.5 (Lai [1, Theorem 1]). If (G) 2, (G) 3, and if every edge of G lies in a 4-cycle, then G is collapsible.