An Important Corollary for the Fast Solution of Dynamic Maximal Clique Enumeration Problems
classification
💻 cs.DM
keywords
algorithmcliqueedgeenumerationmaximaltimealgorithmscliques
read the original abstract
In this paper we modify an algorithm for updating a maximal clique enumeration after an edge insertion to provide an algorithm that runs in linear time with respect to the number of cliques containing one of the edge's endpoints, whereas existing algorithms take quadratic time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.