Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs

  • Ryuhei Uehara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2380)


Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering of the bipartite adjacency matrix. However, the best known algorithm for computing the ordering runs in O(minm log n, n2), which is the bottleneck of the problems. We show a linear time algorithm that computes the ordering of a given chordal bipartite graph. The result improves the upper bounds of several problems, including recognition problem, from O(minm log n, n2) to linear time. Strongly chordal graphs are well-studied subclass of chordal graphs, and that have similar characterization. The upper bounds of several problems on a given strongly chordal graph are also improved from O(minm log n, n2) to linear time.


Chordal bipartite graphs design and analysis of algorithms lexicographic breadth first search vertex elimination ordering strongly chordal graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Bakonyi and A. Bono. Several Results on Chordal Bipartite Graphs. Czechoslovak Math. J., 47:577–583, 1997.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes: A Survey. SIAM, 1999.Google Scholar
  3. 3.
    M.B. Campêlo and S. Klein. Maximum Vertex-Weighted Matching in Strongly Chordal Graphs. Disc. Appl. Math., 84:71–77, 1998.MATHCrossRefGoogle Scholar
  4. 4.
    M.-S. Chang. Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. In 7th ISAAC, pp. 146–155. LNCS Vol. 1178, Springer-Verlag, 1996.Google Scholar
  5. 5.
    D.G. Corneil, S. Olariu, and L. Stewart. The Ultimate Interval Graph Recognition Algorithm? In 9th SODA, pp. 175–180. ACM, 1998.Google Scholar
  6. 6.
    E. Dahlhaus. Generalized Strongly Chordal Graphs. Technical Report TR93-458, University of Sydney, 1993.Google Scholar
  7. 7.
    E. Dahlhaus and M. Karpinski. Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. Disc. Appl. Math., 84:79–91, 1998.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    M. Farber. Characterization of Strongly Chordal Graphs. Disc. Math., 43:173–189, 1983.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    M. Farber. Domination, Independent Domination, and Duality in Strongly Chordal Graphs. Disc. Appl. Math., 7:115–130, 1984.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.Google Scholar
  11. 11.
    M.C. Golumbic and C.F. Goss. Perfect Elimination and Chordal Bipartite Graphs. J. of Graph Theory, 2:155–163, 1978.MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    R. Hayward, C. Hoàng, and F. Maffray. Optimizing Weakly Triangulated Graphs. Graphs and Combinatorics, 5(4):339–349, 1989. [Erratum, ibid., 6(1):33–35, 1990.].MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    A.J. Hoffman, A.W.J. Kolen, and M. Sakarovitch. Totally-Balanced and Greedy Matrices. SIAM J. Alg. Disc. Meth., 6(4):721–730, 1985.MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    C.R. Johnson and J. Miller. Rank Decomposition Under Combinatorial Constraints. Linear Algebra and Its Applications, 251:97–104, 1997.MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    C.R. Johnson and G.T. Whitney. Minimum Rank Completions. Linear and Multilinear Algebra, 28:271–273, 1991.MathSciNetCrossRefGoogle Scholar
  16. 16.
    D. König. Theorie der endlichen und unendlichen Graphen (in German). Akademische Verlagsgesellschaft, 1936.Google Scholar
  17. 17.
    T. Kloks and D. Kratsch. Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. IPL, 55:11–16, 1995.MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    D. Kratsch. Finding Dominating Cliques Efficiently, in Strongly Chordal Graphs and Undirected Path Graphs. Disc. Math., 86:225–238, 1990.MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    A. Lubiw. Doubly Lexical Orderings of Matrices. SIAM J. on Computing, 16(5):854–879, 1987.MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    T.A. McKee and F.R. McMorris. Topics in Intersection Graph Theory. SIAM, 1999.Google Scholar
  21. 21.
    R. Paige and R.E. Tarjan. Three Partition Refinement Algorithms. SIAM J. on Computing, 16(6):973–989, 1987.MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    B.S. Panda. New Linear Time Algorithms for Generating Perfect Elimination Ordering of Chordal Graphs. IPL, 58:111–115, 1996.MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    S.-L. Peng and M.-S. Chang. A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs. IPL, 43:297–300, 1992.MATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    N.K.R. Prasad and P.S. Kumar. On Generating Strong Elimination Orderings of Strongly Chordal Graphs. In FST&TCS, pp. 221–232. LNCS Vol. 1530, Springer-Verlag, 1998.Google Scholar
  25. 25.
    D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. on Computing, 5(2):266–283, 1976.MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    K. Simon. A Note on Lexicographic Breadth First Search for Chordal Graphs. IPL, 54:249–251, 1995.MATHCrossRefGoogle Scholar
  27. 27.
    J.P. Spinrad. Doubly Lexical Ordering of Dense 0-1 matrices. IPL, 45:229–235, 1993.MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    R.E. Tarjan and M. Yannakakis. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. on Computing, 13(3):566–579, 1984.MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    R. Uehara. Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs., 2002.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ryuhei Uehara
    • 1
  1. 1.Natural Science FacultyKomazawa UniversityJapan

Personalised recommendations