#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2001

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shyue-Ming Tang, Yue-Li Wang, Yung-Ho Leu
- J. Inf. Sci. Eng.
- 2004

Two spanning trees rooted at some vertex r in a graph G are said to be independent if for each vertex v of G, v â‰ r, the paths from r to v in two trees are vertex-disjoint. A set of spanning trees ofâ€¦ (More)

- Shyue-Ming Tang, Fu-Long Yeh, Yue-Li Wang
- Inf. Process. Lett.
- 2001

- Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
- IEEE Transactions on Parallel and Distributedâ€¦
- 2007

This paper is concerned with a particular family of regular 4-connected graphs, called chordal rings. Chordal rings are a variation of ring networks. By adding two extra links (or chords) at eachâ€¦ (More)

- Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li
- IEEE Transactions on Parallel and Distributedâ€¦
- 2012

In this paper, we propose a new class of graphs called generalized recursive circulant graphs which is an extension of recursive circulant graphs. While retaining attractive properties of recursiveâ€¦ (More)

- Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
- Theor. Comput. Sci.
- 2009

Two spanning trees of a graph G are said to be independent if they are rooted at the same vertex r, and for each vertex v 6= r in G, the two different paths from v to r, one path in each tree, areâ€¦ (More)

- Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang
- IEICE Transactions
- 2014

- Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
- Int. J. Found. Comput. Sci.
- 2010

- Poâ€“Hung Chen, Yueâ€“Li Wang, Shyue-Ming Tang
- 2005

A polygonal prism with 2n vertices, denoted by PPn, is a product graph of a Cn and a K2. From the outward appearance, a polygonal prism PPn consists of two base faces and n lateral faces. Eachâ€¦ (More)

- Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho
- European Journal of Operational Research
- 2004

In a biconnected graph, a detour is the best alternative path from a detour-starting vertex to the destination vertex. A detour-starting vertex is the vertex from which the original shortest path isâ€¦ (More)

- Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang
- IEEE Transactions on Computers
- 2010

Two spanning trees rooted at vertex r in a graph G are called independent spanning trees (ISTs) if for each vertex v in G, vner, the paths from vertex v to vertex r in these two trees are internallyâ€¦ (More)