Complexity and algorithms for semipaired domination in graphs (Q6830393)
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 7173538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for semipaired domination in graphs |
scientific article; zbMATH DE number 7173538 |
Statements
Complexity and algorithms for semipaired domination in graphs (English)
0 references
25 February 2020
0 references
domination
0 references
semipaired domination
0 references
bipartite graphs
0 references
chordal graphs
0 references
interval graphs
0 references
graph algorithm
0 references
NP-complete
0 references
approximation algorithm
0 references
