The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436): Difference between revisions
From MaRDI portal
Latest revision as of 09:42, 9 July 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
0 references
0 references
0 references