On Random Intersection Graphs: The Subgraph Problem
暂无分享,去创建一个
[1] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .
[2] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..
[3] Michael R. Fellows,et al. On search, decision, and the efficiency of polynomial-time algorithms , 1994, FOCS 1994.
[4] Andrzej Ruciński,et al. Small Subgraphs of k‐Partite Random Graphs , 1989 .
[5] Michael A. Langston,et al. obstruction Set Isolation for the Gate Matrix Layout Problem , 1994, Discret. Appl. Math..
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] Edward R. Scheinerman,et al. Random interval graphs , 1988, Comb..
[8] A.D. Lopez,et al. A Dense Gate Matrix Layout Method for MOS VLSI , 1980, IEEE Journal of Solid-State Circuits.
[9] B. Bollobás. The evolution of random graphs , 1984 .
[10] Michael A. Langston,et al. Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[11] Sajal K. Das,et al. Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis , 1989, FSTTCS.
[12] P. Seymour,et al. Surveys in combinatorics 1985: Graph minors – a survey , 1985 .
[13] Edward R. Scheinerman,et al. An evolution of interval graphs , 1990, Discret. Math..
[14] Edward Szpilrajn-Marczewski. Sur deux propriétés des classes d'ensembles , 1945 .