Finding a dominating set on bipartite graphs (Q963425)
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 a dominating set on bipartite graphs |
scientific article; zbMATH DE number 5694973
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a dominating set on bipartite graphs |
scientific article; zbMATH DE number 5694973 |
Statements
Finding a dominating set on bipartite graphs (English)
0 references
19 April 2010
0 references
graph algorithms
0 references
dominating set
0 references
bipartite graphs
0 references
algorithms
0 references
exponential-time algorithms
0 references
0 references
0.92825377
0 references
0.92144334
0 references
0 references
0 references
0.9172625
0 references
0.90166247
0 references
0.9010408
0 references
0.89914143
0 references
0.89914143
0 references
