Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
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 |
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