Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768)
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 6282837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a minimum outer-connected dominating set for the class of chordal graphs |
scientific article; zbMATH DE number 6282837 |
Statements
Computing a minimum outer-connected dominating set for the class of chordal graphs (English)
0 references
11 April 2014
0 references
graph algorithms
0 references
domination
0 references
outer-connected domination
0 references
proper interval graph
0 references
doubly chordal graph
0 references
undirected path graph
0 references
NP-complete
0 references
0 references
0 references
0.8613151907920837
0 references
0.8595331907272339
0 references
0.857257604598999
0 references
0.8568564653396606
0 references
0.853991687297821
0 references
