1 citations · 2 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
An algorithm with a delay of for enumerating connected induced subgraphs of size
Chenglong Xiao, Chengyong Mao, Shanshan Wang
The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this paper, we propose an algorithm with a delay of $O(kΔ…
cs.DS2021
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
Shanshan Wang, Chenglong Xiao, Emmanuel Casseau
The problem of enumerating all connected induced subgraphs of a given order from a given graph arises in many practical applications: bioinformatics, information retrieval, pro…
cs.DS2021★ 1 cited
Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
Shanshan Wang, Chenglong Xiao
Mining subgraphs with interesting structural properties from networks (or graphs) is a computationally challenging task. In this paper, we propose two algorithms for enumerating al…