#### Filter Results:

#### Publication Year

2005

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Multiple independent spanning trees (ISTs) have applications to fault-tolerant and data broadcasting in interconnections. Thus the designs of multiple ISTs in several classes of networks have been widely investigated. There are two versions of the n ISTs conjecture. The vertex (edge) conjecture is that any n-connected (n-edge-connected) graph has n… (More)

For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular,… (More)

- James K. Lan, Gerard Jennhwa Chang, James K. Lana
- 2012

A mixed dominating set of a simple graph G = (V, E) is a subset D ⊆ V ∪ E such that every vertex or edge not in D is adjacent or incident to at least one vertex or edge in D. The mixed domination problem is to determine a minimum mixed dominating set of G. This paper studies mixed domination in graphs from an algorithmic point of view. In particular, a… (More)

- James K. Lan, Gerard Jennhwa Chang, James K. Lana
- 2012

For a positive integer k, a k-dominating set of a graph G is a subset D ⊆ V (G) such that every vertex not in D is adjacent to at least k vertex in D. The k-domination problem is to determine a minimum k-dominating set of G. This paper studies k-domination problem in graphs from an algorithmic point of view. In particular, we present a linear-time algorithm… (More)

- Rajkumar Buyya, James K. Lan, Chiuyuan Chen, Antoine Bossard, Keiichi Kaneko, Shietung Peng +19 others
- 2011