Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
Résumé
, where ∆ is the maximum degree in the input graph G and n is the number of vertices in G. In this short communication, we first introduce a new neighborhood operator that is the key to design reverse search algorithms for enumerating all connected induced subgraphs of order k. Based on the proposed neighborhood operator, three algorithms with delay of O(k
respectively are proposed. The first two algorithms require exponential space to improve upon the current best delay bound O(k 2 ∆) [4] for this problem in the case k > n log ∆-log n-∆+ √ n log n log ∆ log ∆ and k > n 2 n+∆ respectively.
Domaines
Complexité [cs.CC]Origine | Fichiers produits par l'(les) auteur(s) |
---|