Similar Search Results

Total domination in block graphs

Chang, Gerard J. - 1986

Persistent link: https://www.econbiz.de/10000731574

Labeling algorithms for domination problems in sun-free chordal graphs

Chang, Gerard J. - 1986

Persistent link: https://www.econbiz.de/10000731575

Graphs whose cycles are of length r modulo k

Chang, Gerard J.; Wu, Chia-shyan - 1986

Persistent link: https://www.econbiz.de/10000731581

MPP-greedoids

Chang, Gerard J. - 1986

Persistent link: https://www.econbiz.de/10000720052

The competition number of a graph with exactly two holes

Li, Bo-jr; Chang, Gerard J. - In: Journal of combinatorial optimization 23 (2012) 1, pp. 1-8

Persistent link: https://www.econbiz.de/10009500229

Resource-sharing systems and hypergraph colorings

Lin, Wu-hsiung; Chang, Gerard J. - In: Journal of combinatorial optimization 22 (2011) 4, pp. 499-508

Persistent link: https://www.econbiz.de/10009388464

Roman domination on strongly chordal graphs

Liu, Chun-hung; Chang, Gerard J. - In: Journal of combinatorial optimization 26 (2013) 3, pp. 608-619

Persistent link: https://www.econbiz.de/10010204539

The k-neighbor domination problem

Hwang, Shiow-Fen; Chang, Gerard J. - In: European Journal of Operational Research 52 (1991) 3, pp. 373-377

Persistent link: https://www.econbiz.de/10005151617

The [beta]-assignment problems

Chang, Gerard J.; Ho, Pei-Hsin - In: European Journal of Operational Research 104 (1998) 3, pp. 593-600

Persistent link: https://www.econbiz.de/10005240077

Reliabilities for (n,f,k) systems

Chang, Gerard J.; Cui, Lirong; Hwang, Frank K. - In: Statistics & Probability Letters 43 (1999) 3, pp. 237-242

The (n,f,k) system consists of n components ordered in a line or a cycle, while the system fails if, and only if, there exist at least f failed components or at least k consecutive failed components. For the linear (n,f,k) system with equal component reliabilities, the system reliability formula...

Persistent link: https://www.econbiz.de/10005319291