Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints (Q7021094)
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 7990656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints |
scientific article; zbMATH DE number 7990656 |
Statements
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints (English)
0 references
28 February 2025
0 references
enumeration algorithms
0 references
connected vertex cover
0 references
connected dominating set
0 references
capacitated vertex cover
0 references
capacitated dominating set
0 references
0 references
0 references
0 references
