An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs |
scientific article |
Statements
An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (English)
0 references
25 February 2020
0 references
