A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407)
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 6458173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for paired-domination on circular-arc graphs |
scientific article; zbMATH DE number 6458173 |
Statements
A linear-time algorithm for paired-domination on circular-arc graphs (English)
0 references
13 July 2015
0 references
paired-domination problem
0 references
perfect matching
0 references
interval graph
0 references
circular-arc graph
0 references
0 references
0 references
0 references
0.91367369890213
0 references
0.8662107586860657
0 references
0.8498275279998779
0 references
0.8489054441452026
0 references
0.8473209142684937
0 references
