On Random Intersection Graphs: The Subgraph Problem

Combinatorics Probability and Computing

Volumn 8, Issue 1-2, 1999, Pages 131-159

  Karoński, Michał ^a,b   Scheinerman, Edward R ^c   Singer Cohen, Karen B ^b,d  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b EMORY UNIVERSITY   (United States)

^c JOHNS HOPKINS UNIVERSITY   (United States)

^d UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844477858     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548398003459     Document Type: Article

References (19)

1. Bollobás, B. (1985) Random Graphs, Academic.
2. Das, S. Expected number of tracks for gate matrix, Dept. of Computer Science, University of North Texas.
3. Das, S., Deo, N., and Prasad, S. (1989) Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis, Vol. 405 of Lecture Notes in Computer Science, Springer, pp. 280-290.
4. Deo, N., Krishnamoorthy, M., and Langston, M. (1987) Exact and approximate solutions for the gate matrix layout problem, IEEE Trans. Computer-Aided Design CAD-6 79-84.
5. Erdos, P. and Rényi, A. (1960) On the evolution of random graphs. MTA Mat. Kut. Int. Kozl. 5 17-61.
6. Fellows, M. and Langston, M. (1987/88) Nonconstructive advances in polynomial-time complexity. Information Processing Letters 26 157-162.
7. Fellows, M. and Langston, M. (1994) On search, decision, and the efficiency of polynomial-time algorithms. J. Computer and System Sciences 49 769-779.
8. Golumbic, M. (1980) Algorithmic Graph Theory and Perfect Graphs, Academic.
9. Karoński, M. (1995) Random graphs. In Handbook of Combinatorics (R. L. Graham, M. Grötschel and L. Lovász, eds), Vol. 1, Elsevier, pp. 351-380.
10. Karoński, M. and Ruciński, A. (1989) Small subgraphs of k-partite random graphs. In Combinatorial Mathematics: Proc. Third International Conference, New York, 1985, 555, New York Academy of Sciences, pp. 230-240.
11. Kashiwabara, T. and Fujisawa, T. (1979) An NP-complete problem on interval graphs. Proc. IEEE Symposium on Circuits and Systems, 82-83.
12. Kinnersley, N. and Langston, M. (1994) Obstruction set isolation for the gate matrix layout problem. Discrete Appl. Math. 54 169-213
13. Lekkerkerker, C. B. and Boland, J. C. (1962) Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51 45-64.
14. Lopez, A., and Law, H.-F. (1980) A dense gate matrix layout method for MOS VLSI. IEEE Trans. Electron Devices ED-27 1671-1675.
15. Marczewski, E. (1945) Sur deux propriétés des classes d'ensembles. Fund. Math. 33 303-307.
16. Robertson, N. and Seymour, P. D. (1985) Graph minors - A Survey. In Surveys in Combinatorics (I. Anderson, ed.), Cambridge University Press, Cambridge, pp. 153-171.
17. Scheinerman, E. A. (1988) Random interval graphs. Combinatorica 8 357-371.
18. Scheinerman, E. A. (1990) An evolution of interval graphs. Discrete Math. 82 287-302.
19. Singer, K. (1995) Random Intersection Graphs, PhD thesis, Johns Hopkins University.