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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 147-155

  Chang, Maw Shang ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

CHORDAL BIPARTITE GRAPH; LINEAR-TIME ALGORITHMS; MAXIMUM MATCHINGS; TIME ALGORITHMS;

GRAPH THEORY;

EID: 84990192698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009490     Document Type: Conference Paper

References (15)

1. H. Bodlaender, T. Kloks, D. Kratsch, and H. Miiller, Treewidth and minimum fillin on d-trapezoid graphs, Technical Report UU-CS-1995-34, Utrecht University.
2. A. Brandstädt, Classes of bipartite graphs related to chordal graphs, Discrete Appl. Math. 32 (1991) 51-60.
3. D. G. Corneil, Y. Perl, and L. K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numerantium, 43 (1984) 249-258.
4. M. Farber, Characterization of strongly chordal graphs, Discrete Math. 43 (1983) 173-189.
5. F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks 17 (1987) 465-470.
6. 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
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).
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.
9. A. Parra, Triangulating multitolerance graphs, Technical Report, 392/1994, Technische Universität Berlin.
10. D. J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
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.
12. J. P. Spinrad, Doubly lexical ordering of dense 0-1 matrices, Information Processing Letters 45 (1993) 229-235.
13. J. P. Spinrad, A. Brandstädt, and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. 18 (1987) 279-292.
14. R. E. Tarjan, Decomposition by clique seperators, Discrete Math. 55 (1985) 221-232.
15. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1981) 77-79.