Li-Jen Mao

According to our database, Li-Jen Mao authored at least 4 papers between 1998 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.

Li-Jen Mao, Sheau-Dong Lang

Proceedings of the 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 2002

1999

A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.

Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Probabilistic analysis of the RNN-CLINK clustering algorithm.

Sheau-Dong Lang, Li-Jen Mao, Wen-Lin Hsu

Proceedings of the Data Mining and Knowledge Discovery: Theory, 1999

1998

A Comparison of Two Torus-Based K-Coteries.

Sheau-Dong Lang, Li-Jen Mao

Proceedings of the International Conference on Parallel and Distributed Systems, 1998