Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs

Christoforos Raptopoulos, Paul G. Spirakis. Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 493-504, Springer, 2005. [doi]

@inproceedings{RaptopoulosS05,
  title = {Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs},
  author = {Christoforos Raptopoulos and Paul G. Spirakis},
  year = {2005},
  doi = {10.1007/11602613_50},
  url = {http://dx.doi.org/10.1007/11602613_50},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/RaptopoulosS05},
  cites = {0},
  citedby = {0},
  pages = {493-504},
  booktitle = {Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  editor = {Xiaotie Deng and Ding-Zhu Du},
  volume = {3827},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30935-7},
}