Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675): 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.1007/s10878-008-9141-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039933854 / rank | |||
Normal rank | |||
Revision as of 15:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized dominating set problem in chordal graphs: Complexity and lower bound |
scientific article |
Statements
Parameterized dominating set problem in chordal graphs: Complexity and lower bound (English)
0 references
2 September 2009
0 references
chordal graphs
0 references
dominating set
0 references
parameterized complexity
0 references
lower bound
0 references
interval graphs
0 references
