Complexity and algorithms for graph and hypergraph sandwich problems

Graphs and Combinatorics

Volumn 14, Issue 3, 1998, Pages 223-239

  Golumbic, Martin Charles ^a   Wassermann, Amir ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4243176388     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050028     Document Type: Article

References (34)

1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277-284 (1987)
2. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth. 7, 305-314 (1986)
3. Beeri, C., Fagin, R., Maier, D., Mendelzon, A.O.: Ullman, J., Yannakakis, M.: Properties of acyclic database schemes, Proc. 13th Ann. ACM Symp. on Theory of Computing pp. 355-362 (Milwaukee, Wise, May 11-13, 1981), New York: ACM
4. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of database schemes. J. ACM, 479-513 (1983)
5. Benzer, S.: On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. 45, USA, 1607-1620 (1959)
6. Berge, C., Graphs and Hypergraphs. Amsterdam: North-Holland 1973
7. Booth, K.S., Lueker, L.S.: Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. of Comp. and Sys. Sci. 13, 335-379 (1976)
8. Duchet, P.: Classical perfect graphs. Ann. Discrete Math. 21, 67-96 (1984)
9. Fagin, R.: Acyclic Database Schemes (of various degrees): A Painless introduction. Lecture Notes in Computer Science, 159, 65-89 (1983)
10. Flament, C.: Hypergraphes arborés. Discrete Math. 43, 223-226 (1978)
11. Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835-855 (1965)
12. Ghosh, S.P., Kambayaski, Y., Lipski, Jr., W.: Data base file organization theory and applications of the consecutive retrieval property. New York: Academic Press 1983
13. Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canadian J. Math. 16, 539-548 (1964)
14. Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comp. Biology 2, 139-152 (1995)
15. Golumbic, M.C.: Algorithmic graph theory and perfect graphs, New York: Academic Press, 1980
16. Golumbic, M.C.: Algorithmic aspects of intersection graphs and representation hypergraphs, Graphs and Combinatorics 4, 307-321 (1988)
17. Golumbic, M.C.: Matrix sandwich problems. Linear Algebra and Its Applications 277, 239-251 (1998)
18. Golumbic, M.C., Kaplan H., and Shamir R., On the complexity of DNA physical mapping. Adv. Appl. Math. 15, 251-261 (1994)
19. Golumbic, M.C., Kaplan, H., Shamir, R.: Graph Sandwich Problems. J. of Algorithms 19, 449-473 (1995)
20. Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph theoretic approach. J. Assoc. Comput. Mach. 40, 1108-1133 (1993)
21. Goodman, N., Shmueli, O.: Syntactic characterization of tree database schemes. J. Assoc. Comput. Mach. 30, 767-786 (1983)
22. Kendall, D.G.: Incidence matrices, interval graphs and seriation in archeology. Pacific J. Math. 28(3), 565-570 (1969)
23. Lekkerkerker, C.G., Boland, J. Ch.: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51, 45-64 (1962)
24. Maier, D.: The theory of relational databases. Rockville: Computer Science Press 1983
25. Opatrny, J.: Total ordering problems. SIAM J. Comp. 8(1), 111-114 (1979)
26. Quilliot, A.: Circular representation problems on hypergraphs. Discrete Math. 51, 251-264 (1984)
27. Robertson, N., Seymour, P.D.: Disjoint paths - a survey. SIAM J. Alg. Disc. Meth. 6, 300-305 (1985)
28. Rose, D.: On simple characterization of k-trees. Discrete Math. 7, 317-322 (1974)
29. Rose, D.: Triangular graphs and the elimination process. J. Math. Anal. Appl. 32, 597-609 (1970)
30. Ryser, H.J.: Combinatorical configurations. SIAM J. Appl. Math. 17(3), 593-602 (1969)
31. Tucker, A.C.: Characterizing circular arc graphs. Bull. Amer. Math. Soc. 76, 1257-1260 (1970)
32. Tucker, A.C.: A structure theorem for consecutive 1's property. J. Comb. Theory 12, 153-162 (1972)
33. Wassermann A.: Complexity and algorithms for graph and hypergraph problems, M.Sc. Thesis (Sept. 1995), Bar-Ilan University, Ramat-Gan, Israel
34. S.A. Ward and R.H. Halstead: Computation Structures. Cambridge: MIT Press 1990