Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:47, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a minimum outer-connected dominating set for the class of chordal graphs |
scientific article |
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
