A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667)
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 5523153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for the paired-domination problem on permutation graphs |
scientific article; zbMATH DE number 5523153 |
Statements
A polynomial-time algorithm for the paired-domination problem on permutation graphs (English)
0 references
4 March 2009
0 references
algorithm
0 references
permutation graph
0 references
paired-domination
0 references
0 references
0.9280072450637816
0 references
0.9248650670051576
0 references
0.8625711798667908
0 references
0.8563939332962036
0 references
