Matrix sandwich problems

Linear Algebra and Its Applications

Volumn 277, Issue 1-3, 1998, Pages 239-251

  Golumbic, Martin Charles ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Block decomposition of matrices; Ferrers diagrams; Forbidden submatrix problems; Matrix completion problems; Matrix sandwich problems

Indexed keywords

EID: 0042095072     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(97)10075-1     Document Type: Article

References (32)

1. M. Bakonyi, C.R. Johnson, The Euclidean distance matrix completion problem, SIAM J. Matrix Anal. Appl. (to appear).
2. W. Barrett, C.R. Johnson, R. Loewy, The real positive definite completion problem: Cycle completability, Mem. Amer. Math. Soc. 122 (584) (1996) 1-69.
3. W. Barrett, C.R. Johnson, M. Lundquist, Determinantal formulae for matrix completions associated with chordal graphs, Linear Algebra Appl. 121 (1989) 265-289.
4. W. Barrett, C.R. Johnson, P. Tarazaga, The real positive definite completion problem for a simple cycle, Linear Algebra Appl. 192 (1993) 3-31.
5. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
6. H.L. Bodlaender, M.R. Fellows, T.J. Warnow, Two strikes against perfect phytogeny, Proceedings of the 19th ICALP, Lecture Notes in Computer Science 623 (1992) 273-283.
7. K.S. Booth, L.S. Lueker, Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
8. E. Boros, T. Ibaraki, K. Makino, Extensions of partially defined Boolean functions with missing data, RUTCOR Research Report RRR 6-96, Rutgers University, 1996.
9. M.R. Cerioli, H. Everett, C.M.H. de Figueiredo, S. Klein, The homogeneous set sandwich problem, manuscript 1996.
10. O. Cogis, Ferrers digraphs and threshold graphs, Discrete Math. 38 (1982) 33-46.
11. H. Dym, I. Gohberg, Extensions of band matrices with band inverses, Linear Algebra Appl. 36 (1981) 1-24.
12. P. Duchet, Classical perfect graphs, Ann. Discrete Math. 21 (1984) 67-96.
13. D.R. Fulkerson, O.A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
14. S.P. Ghosh, Y. Kambayaski, W. Lipski Jr., Data Base File Organization Theory and Applications of the Consecutive Retrieval Property, Academic Press, New York, 1983.
15. P.C. Gilmore, A.J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. 16 (1964) 539-548.
16. P.W. Goldberg, M.C. Golumbic, H. Kaplan, R. Shamir, Four strikes against physical mapping of DNA, J. Comput. Biology 2 (1995) 139-152.
17. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
18. M.C. Golumbic, Algorithmic aspects of intersection graphs and representation hypergraphs, Graphs Combin. 4 (1988) 307-321.
19. M.C. Golumbic, H. Kaplan, R. Shamir, On the complexity of DNA physical mapping, Adv. in Appl. Math. 15 (1994) 251-261.
20. M.C. Golumbic, H. Kaplan, R. Shamir, Graph sandwich problems, J. Algorithms 19 (1995) 449-473.
21. M.C. Golumbic, R. Shamir, Complexity and algorithms for reasoning about time: a graph theoretic approach, J. Assoc. Comput. Mach. 40 (1993) 1108-1133.
22. M.C. Golumbic, A. Wassermann, Complexity and algorithms for graph and hypergraph sandwich problems, Technical Report 96-03, Institute for Computer Science Research, Bar-Ilan University, Ramat-Gan, Israel, 1996 (to appear in Graphs and Combinatorics).
23. R. Grone, C.R. Johnson, E. Sá, H. Wolkowicz, Positive definite completions of partial Hermitian matrices, Linear Algebra Appl. 58 (1984) 109-124.
24. C.R. Johnson, Matrix completion problems: A survey, Proceedings of the Symposia in Applied Mathematics, Amer. Math. Soc. 40 (1990) 171-198.
25. H. Kaplan, R. Shamir, Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques, SIAM J. Comput. 25 (1996) 540-561.
26. B. Klinz, R. Rüdolf, G.J. Woeginger, Permuting matrices to avoid forbidden submatrices. Discrete Appl. Math. 60 (1995) 223-248.
27. M. Krupnik, L. Rodman, Completions of partial Jordan and Hessenbery matrices, Linear Algebra Appl. 212/213 (1994) 267-287.
28. N. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Ann. Discrete Math., vol. 56, Elsevier, Amsterdam, 1995.
29. F.S. Roberts, Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems, Prentice-Hall, Englewood Cliffs, NJ, 1976.
30. M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992) 91-116.
31. A.C. Tucker, A structure theorem for consecutive 1's property, J. Combin. Theory 12 (1972) 153-162.
32. P. van Beek, Query processing with indefinite information, Artificial Intelligence in Medicine 3 (1991) 325-339.