The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436): 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/s00453-012-9681-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083586074 / rank | |||
Normal rank | |||
Revision as of 01:48, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The kernelization complexity of connected domination in graphs with (no) small cycles |
scientific article |
Statements
The kernelization complexity of connected domination in graphs with (no) small cycles (English)
0 references
2 December 2014
0 references
connected dominating set
0 references
kernelization
0 references
girth
0 references
fixed-parameter tractability
0 references
kernel lower bounds
0 references
