Journal of the ACM Bibliography
K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time
computability of combinatorial problems on series-parallel graphs.
Journal of the ACM, 29(3):623-641, July 1982.
[BibTeX entry]
Selected papers that cite this one
- Brenda S. Baker. Approximation algorithms for
NP-complete problems on planar graphs. Journal of the
ACM, 41(1):153-180, January 1994.
- Yuval Caspi and Eliezer Dekel. Edge coloring series
parallel graphs. Journal of Algorithms, 18(2):296-321,
March 1995.
- David Eppstein. Parallel
recognition of series-parallel graphs. Information and
Computation, 98(1):41-55, May 1992.
- Lucian Finta, Zhen Liu, Ioannis Milis, and Evripidis Bampis. Scheduling UET-UCT
series-parallel graphs on two processors. Theoretical Computer
Science, 162(2):323-340, 20 August 1996.
- Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai, and
Jeng-Yan Hwang. The recognition of double
Euler trails in series-parallel networks. Journal of
Algorithms, 28(2), August 1998.
- Paul Tseng and Zhi-Quan Luo. On computing the nested
sums and infimal convolutions of convex piecewise-linear functions.
Journal of Algorithms, 21(2):240-266, September 1996.
- Xiao Zhou, Shin-ichi Nakano, and Takao Nishizeki. Edge-coloring partial
k-trees. Journal of Algorithms,
21(3):598-617, November 1996.
- Xiao Zhou, Hitoshi Suzuki, and Takao Nishizeki. A linear algorithm for
edge-coloring series-parallel multigraphs. Journal of
Algorithms, 20(1):174-201, January 1996.
- Xiao Zhou, Hitoshi Suzuki, and Takao Nishizeki. An NC parallel
algorithm for edge-coloring series-parallel multigraphs.
Journal of Algorithms, 23(2):359-374, May 1997.
Shortcuts: