3 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura +1
In this paper, we propose a characterization of chordal bipartite graphs and an efficient enumeration algorithm for chordal bipartite induced subgraphs. A chordal bipartite graph i…
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…
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…