The maximum vertex coverage problem on bipartite graphs (Q2448919)
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 6292087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum vertex coverage problem on bipartite graphs |
scientific article; zbMATH DE number 6292087 |
Statements
The maximum vertex coverage problem on bipartite graphs (English)
0 references
5 May 2014
0 references
vertex cover
0 references
transversal number
0 references
matching
0 references
hypergraphs
0 references
clique covering
0 references
NP-hardness
0 references
0 references
0.8903681635856628
0 references
0.8622728586196899
0 references
0.7993875741958618
0 references
0.7960464954376221
0 references
0.7947232723236084
0 references
