Finding bipartite subgraphs efficiently (Q991744)
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: Finding bipartite subgraphs efficiently |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding bipartite subgraphs efficiently |
scientific article |
Statements
Finding bipartite subgraphs efficiently (English)
0 references
7 September 2010
0 references
algorithms
0 references
graph algorithm
0 references
bipartite graph
0 references
extremal graph theory
0 references
0.8170397877693176
0 references
0.8161600232124329
0 references
0.8123754858970642
0 references
0.8045821189880371
0 references
