#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1993

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ka Wong Chong, Tak Wah Lam
- J. Algorithms
- 1993

- Ka Wong Chong, Yijie Han, Tak Wah Lam
- J. ACM
- 2001

This paper resolves a long-standing open problem on whether the concurrent write capability of parallel random access machine (PRAM) is essential for solving fundamental graph problems like connected components and minimum spanning trees in <italic>O</italic>(log<italic>n</italic>) time. Specifically, we present a new algorithm to solve these problems in… (More)

- Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios
- Theory of Computing Systems
- 2003

In this paper we consider the problem of computing the connected components of the complement of a given graph. We describe a simple sequential algorithm for this problem, which works on the input graph and not on its complement, and which for a graph on n vertices and m edges runs in optimal O(n+m) time. Moreover, unlike previous linear co-connectivity… (More)

- Ka Wong Chong, Tak Wah Lam
- SODA '93
- 1993

In this paper we present a new parallel algorithm for finding the connected components of an undirected graph. On a graph with n vertices and m edges, the algorithm runs in O(log n loglog n) time using n + m processors on an EREW (exclusive-read and exclusive-write) PRAM. Prior to our work, the best known exclusive-write algorithm for this problem requires… (More)

- Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
- Discrete Applied Mathematics
- 2003

- Ka Wong Chong, Yijie Han, Tak Wah Lam
- SODA
- 1999

We present a new approach to finding minimum spanning trees of weighted undirected graphs on the parallel random access machine (PRAM) without concurrent-write power. This approach gives an algorithm that runs in O(log n) time using n + m processors on the EREW PRAM, settling a long-standing open problem in the literature.

- Ka Wong Chong, Tak Wah Lam
- SODA
- 1996

The problem of finding the minimum bicon-netted spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to… (More)

- Ka Wong Chong, Tak Wah Lam
- Algorithmica
- 1995

Consider the following NP-hard problems: Given a graph G , find minimum 2-edge connected and 2-vertex connected subgraphs spanning all vertices of G . Over the past few years, exciting sequential algorithms for approximating such minimum subgraphs have been produced [6],[10]. The approximation factors are improved from 2 to 3/2 for both of the problems. Yet… (More)

- Ka Wong Chong, Tak Wah Lam
- ISAAC
- 1996

- Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
- COCOON
- 1999