Complexity and algorithms for semipaired domination in graphs (Q5918285)
From MaRDI portal
(Redirected from Item:Q5919474)
| 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: Complexity and algorithms for semipaired domination in graphs |
scientific article; zbMATH DE number 7173538
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
11 June 2021
0 references
25 February 2020
0 references
domination
0 references
semipaired domination
0 references
interval graphs
0 references
graph algorithm
0 references
NP-completeness
0 references
approximation algorithm
0 references
bipartite graphs
0 references
chordal graphs
0 references
NP-complete
0 references
0 references
0.99999976
0 references
0.9637197
0 references
0.9582964
0 references
0.93016803
0 references
0.9207636
0 references
0.92033756
0 references