📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs

First Author: Christodoulou F

Attributed to: Algorithmic Aspects of Temporal Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-031-23101-8_2

Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85146722468

Type: Book Chapter

Book Title: SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings (2023)

Page Reference: 18-32