An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
From MaRDI portal
Publication:2301754
DOI10.1007/978-3-030-25005-8_28OpenAlexW3098933002MaRDI QIDQ2301754
Hiroki Arimura, Kunihiro Wasa, Takeaki Uno, Kazuhiro Kurita
Publication date: 25 February 2020
Full work available at URL: https://arxiv.org/abs/1903.02161
This page was built for publication: An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs