Finding Small Complete Subgraphs Efficiently

Adrian Dumitrescu, Andrzej Lingas. Finding Small Complete Subgraphs Efficiently. In Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, editors, Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings. Volume 13889 of Lecture Notes in Computer Science, pages 185-196, Springer, 2023. [doi]

@inproceedings{DumitrescuL23,
  title = {Finding Small Complete Subgraphs Efficiently},
  author = {Adrian Dumitrescu and Andrzej Lingas},
  year = {2023},
  doi = {10.1007/978-3-031-34347-6_16},
  url = {https://doi.org/10.1007/978-3-031-34347-6_16},
  researchr = {https://researchr.org/publication/DumitrescuL23},
  cites = {0},
  citedby = {0},
  pages = {185-196},
  booktitle = {Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings},
  editor = {Sun-Yuan Hsieh and Ling-Ju Hung and Chia-Wei Lee},
  volume = {13889},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-34347-6},
}