15 citations · 65 across the 24 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
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.DS2018★ 2 cited
Efficient Enumeration of Bipartite Subgraphs in Graphs
Kunihiro Wasa, Takeaki Uno
Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been wide…
cs.DS2018★ 1 cited
Efficient Enumeration of Dominating Sets for Sparse Graphs
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura +1
A dominating set of a graph is a set of vertices such that any vertex in is in or its neighbor is in . Enumeration of minimal dominating sets in a graph is one o…