Biconvex graphs: Ordering and algorithms

Discrete Applied Mathematics

Volumn 103, Issue 1-3, 2000, Pages 1-19

  Abbas, Nesrine ^a   Stewart, Lorna K ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Algorithms; Biconvex graphs; Bipartite graphs; Vertex orderings; Vertex ranking

Indexed keywords

EID: 0347304294     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00217-6     Document Type: Article

References (15)

1. N. Abbas, Graph clustering: complexity, sequential and parallel algorithms, Ph.D. Thesis, Dept. of Computing Science, University of Alberta, 1995.
2. S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. H. L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, Zs. Tuza, Rankings of graphs, WG 94, Herrsching, 1994, Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 292-304.
4. Bodlaender H.L., Deogun J.S., Jansen K., Kloks T., Kratsch D., Müller H., Tuza Zs. Rankings of graphs. SIAM J. Discrete Math. 11:1998;168-181.
5. A. Brandstädt, Classes of bipartite graphs related to chordal graphs and domination of one color class by the other, Technical Report N / 88 / 10, Friedrich-Schiller-Universität, Jena, 1988.
6. J.S. Deogun, T. Kloks, D. Kratsch, H. Müller, On vertex ranking for permutation and other graphs, in Proceedings of STACS 94, Caen, 1994, Springer, Berlin, 1994, Lecture Notes in Computer Science Vol. 775, pp. 747-758.
7. Elmallah E.S., Stewart L.K. Polygon graph recognition. J. Algorithms. 26:1998;101-140.
8. Farber M. Characterization of strongly chordal graphs. Discrete Math. 43:1983;173-189.
9. Glover F. Maximum matching in a convex bipartite graph. Naval Res. Logist. Quart. 14:1967;313-316.
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. Klein P.N. Efficient parallel algorithms for chordal graphs. SIAM J. Comput. 25:1996;797-827.
12. Lipski W. Jr., Preparata F.P. Efficient Algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inform. 15:1981;329-346.
13. Spinrad J., Brandstädt A., Stewart L. Bipartite permutation graphs. Discrete Appl. Math. 18:1987;279-292.
14. Tucker A. A Structure theorem for the consecutive 1's property. J. Combin. Theory Ser. B 12:1972;153-162.
15. Yu C.-W., Chen G.-H. Efficient parallel algorithms for doubly convex-bipartite graphs. Theoret. Comput. Sci. 147:1995;249-265.