Efficient enumeration of bipartite subgraphs in graphs (Q1791004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6946808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient enumeration of bipartite subgraphs in graphs |
scientific article; zbMATH DE number 6946808 |
Statements
Efficient enumeration of bipartite subgraphs in graphs (English)
0 references
4 October 2018
0 references
graph algorithms
0 references
subgraph enumeration
0 references
bipartite graphs
0 references
constant delay
0 references
binary partition method
0 references
degeneracy
0 references
0.7918359637260437
0 references
0.7887898683547974
0 references
0.7823624610900879
0 references
0.7761024236679077
0 references
0.771081805229187
0 references
