Journal of the ACM Bibliography

Selected papers that cite this one

• Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1-45, 6 December 1998. Tutorial.

• Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, December 1996.

• Hans L. Bodlaender and Ton Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21(2):358-402, September 1996.

• Bruno Courcelle. Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science, 163(1-2):1-54, 30 August 1996. Tutorial.

• Bruno Courcelle. Recognizable sets of graphs: equivalent definitions and closure properties. Mathematical Structures in Computer Science, 4(1):1-32, March 1994.

• Bruno Courcelle and Jens Lagergren. Equivalent definitions of recognizability for sets of graphs of bounded tree-width. Mathematical Structures in Computer Science, 6(2):141-165, April 1996.

• Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Bicriteria network design problems. Journal of Algorithms, 28(1):142-171, July 1998.

• Detlef Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6(6):505-526, December 1996.

• Géraud Sénizergues. A polynomial algorithm testing partial confluence of basic semi-Thue systems. Theoretical Computer Science, 192(1):55-75, 10 February 1998.

• 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.

Selected references

• T. Beyer, W. Jones, and S. Mitchell. Linear algorithms for isomorphism of maximal outerplanar graphs. Journal of the ACM, 26(4):603-610, October 1979.

• Bruno Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85(1):12-75, March 1990.

• Michael R. Fellows and Michael A. Langston. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pages 520-525, Research Triangle Park, North Carolina, 30 October-1 November 1989. IEEE.

• Jens Lagergren. Efficient parallel algorithms for tree-decomposition and related problems. In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 173-182, St. Louis, Missouri, 22-24 October 1990. IEEE.

Shortcuts: