An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs |
scientific article; zbMATH DE number 7173543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs |
scientific article; zbMATH DE number 7173543 |
Statements
An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (English)
0 references
25 February 2020
0 references
0.9230139
0 references
0 references
0.90323985
0 references
0.9025405
0 references
0.90228206
0 references
0.8898824
0 references
0 references
0 references
0.8843657
0 references
0.8818505
0 references
