Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1996: Algorithms and Computation pp 146–155Cite as

Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs

  • Session 4b: Invited Presentation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Abstract

We define an ordering of vertices of a chordal bipartite graph. By using this ordering, we give a linear time algorithm for the maximum matching problem and an O(n 4) time algorithm for the minimum fill-in problem on chordal bipartite graphs improving previous results.

Supported partly by the National Science Council of the Republic of China under grant NSC 83-0208-M-194-017.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bodlaender, T. Kloks, D. Kratsch, and H. Müller, Treewidth and minimum fill-in on d-trapezoid graphs, Technical Report UU-CS-1995-34, Utrecht University.

    Google Scholar 

  2. A. Brandstädt, Classes of bipartite graphs related to chordal graphs, Discrete Appl. Math. 32 (1991) 51–60.

    Article  Google Scholar 

  3. D. G. Corneil, Y. Perl, and L. K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numerantium, 43 (1984) 249–258.

    Google Scholar 

  4. M. Farber, Characterization of strongly chordal graphs, Discrete Math. 43 (1983) 173–189.

    Article  Google Scholar 

  5. F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks 17 (1987) 465–470.

    Google Scholar 

  6. J. E. Hopcroft and R. M. Karp, A n 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225–231.

    Article  Google Scholar 

  7. T. Kloks, Minimum fill-in for chordal bipartite graphs, Technical report RUU-CS-93-11, Department of CS, Utrecht Universtity, Utrecht The Netherlands (1993).

    Google Scholar 

  8. T. Kloks, D. Kratsch, and C. K. Wong, Minimum fill-in on circle and circular-arc graphs, To appear in the proceedings of ICALP'96.

    Google Scholar 

  9. A. Parra, Triangulating multitolerance graphs, Technical Report, 392/1994, Technische Universität Berlin.

    Google Scholar 

  10. D. J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597–609.

    Article  Google Scholar 

  11. D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in: Graph Theory and Computing, R. Read, (ed.), Academic Press, New York, (1973) 183–217.

    Google Scholar 

  12. J. P. Spinrad, Doubly lexical ordering of dense 0–1 matrices, Information Processing Letters 45 (1993) 229–235.

    Article  Google Scholar 

  13. J. P. Spinrad, A. Brandstädt, and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. 18 (1987) 279–292.

    Article  Google Scholar 

  14. R. E. Tarjan, Decomposition by clique seperators, Discrete Math. 55 (1985) 221–232.

    Article  Google Scholar 

  15. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1981) 77–79.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiun, 621, Chiayi, Taiwan Republic of China

    Maw-Shang Chang

Authors
  1. Maw-Shang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, MS. (1996). Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009490

Download citation

  • DOI: https://doi.org/10.1007/BFb0009490

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation