Bipartite permutation graphs with application to the minimum buffer size problem

Discrete Applied Mathematics

Volumn 74, Issue 1, 1997, Pages 33-55

  Lai, Ten Hwang ^a   Wei, Shu Shang ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043265731     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00014-5     Document Type: Article

References (11)

1. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trec algorithms, J. Comput. System Sci. 13 (1976) 335-379.
2. F. Fotouhi and S. Pramanik, Optimal secondary storage access sequence tor performing relational join, IEEE Trans. Knowledge Data Eng. 1 (1989) 318-328.
3. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
4. T.H. Lai and S.S. Wei, Algorithms for page retrieval and Hamiltonian paths on forward-convex line graphs, J. Algorithms, 18 (1995) 358-373.
5. E.R. Omiecinski, Heuristics for join processing using nonclustered indexes. IEEE Trans. Software Eng. 15 (1989) 18-25.
6. S. Pramanik and D. Ittner, Use of graph-theoretic models for optimal relational database accesses to perform join, ACM Trans. Database Systems 10 (1985) 57-74.
7. J. Spinrad, Two dimensional partial orders, Ph.D. Thesis, Dept. of EECS. Princeton University (1982).
8. J. Spinrad, A. Brandstadt and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math. 18 (1987) 279-292.
9. L.K. Stewart, Permutation graph structure and algorithms. Ph.D. Thesis, Dept. of Computer Science, University of Toronto (1985).
10. A. Tucker, A structure theorem for the consecutive 1's property, J. Combin. Theory 12(B) (1972) 153-162.
11. S.S. Wei, Design and analysis of algorithms for processing queries in database systems, Ph.D. Thesis, Department of CIS, The Ohio State University (1992).