Equivalence of a random intersection graph and ::::G::::(::::n::::, ::::p::::)

Katarzyna Rybarczyk. Equivalence of a random intersection graph and ::::G::::(::::n::::, ::::p::::). Random Struct. Algorithms, 38(1-2):205-234, 2011. [doi]

@article{Rybarczyk11,
  title = {Equivalence of a random intersection graph and ::::G::::(::::n::::, ::::p::::)},
  author = {Katarzyna Rybarczyk},
  year = {2011},
  doi = {10.1002/rsa.20356},
  url = {http://dx.doi.org/10.1002/rsa.20356},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Rybarczyk11},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {38},
  number = {1-2},
  pages = {205-234},
}