1 citations · 1 across the 2 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte +2
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related p…
cs.DM2018
Listing Maximal Subgraphs in Strongly Accessible Set Systems
Alessio Conte, Roberto Grossi, Andrea Marino +1
Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) u…