Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (Q5757876)
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 5188769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes |
scientific article; zbMATH DE number 5188769 |
Statements
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (English)
0 references
7 September 2007
0 references
0.9782046675682068
0 references
0.8452848196029663
0 references
0.8273643851280212
0 references
0.8179028034210205
0 references
0.8046011328697205
0 references
