#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1990

1999

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tze-Heng Ma, Jeremy P. Spinrad
- J. Algorithms
- 1994

- Wen-Lian Hsu, Tze-Heng Ma
- ISA
- 1991

In this paper, we present a linear time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear time algorithm for transitive orientation on chordal comparability graphs. Which reduces the complexity of chordal comparability recognition from O(n ~) to O(n + m). We also devise a simple linear time algorithm for… (More)

- Tze-Heng Ma, Jeremy P. Spinrad
- J. Algorithms
- 1994

- Tze-Heng Ma, Jeremy P. Spinrad
- SODA
- 1991

- Wen-Lian Hsu, Tze-Heng Ma
- SIAM J. Comput.
- 1999

In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n) to O(n+m). We also devise a simple linear-time algorithm for… (More)

- Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung
- ISAAC
- 1992

- Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma
- Theor. Comput. Sci.
- 1998

The k-chain subgraph cover problem asks if the edge set of a given bipartite graph G is the union of the edge sets of k chain graphs, where each chain graph is a subgraph of G. Although the X--chain subgraph cover problem is known to be NP-complete for the class of bipartite graphs, it is still unknown whether this problem is NP-complete or polynomial-time… (More)

- Tze-Heng Ma, Jeremy P. Spinrad
- WG
- 1990

- Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma
- Graphs and Combinatorics
- 1996

- Tze-Heng Ma, Jeremy P. Spinrad
- SODA
- 1990

The split decomposition of a graph, which is also known as the join decomposition [GHS], ms], was developed by Cunningham [Cu] . Originally, the decomposition was seen primarily as a tool for dealing with directed graphs. Recently, however, the undirected version of this decomposition has been used as part of efficient algorithms for dealing with a number… (More)