Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029336174 / rank | |||
Normal rank | |||
Latest revision as of 02:18, 20 March 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
