A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:52, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial-time algorithm for the paired-domination problem on permutation graphs |
scientific article |
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