Linear-time algorithm for the matched-domination problem in cographs (Q3101607)
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 5982501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time algorithm for the matched-domination problem in cographs |
scientific article; zbMATH DE number 5982501 |
Statements
Linear-time algorithm for the matched-domination problem in cographs (English)
0 references
29 November 2011
0 references
graph algorithm
0 references
paired-domination
0 references
constrained vertex set
0 references
matched-domination
0 references
cographs
0 references
0 references
0.8548487424850464
0 references
0.846136212348938
0 references
0.8303952813148499
0 references
0.8297426104545593
0 references
0.8258883357048035
0 references
