The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The kernelization complexity of connected domination in graphs with (no) small cycles |
scientific article; zbMATH DE number 6375639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The kernelization complexity of connected domination in graphs with (no) small cycles |
scientific article; zbMATH DE number 6375639 |
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
0.9648472666740416
0 references
0.8294641375541687
0 references
0.823057234287262
0 references
0.8113091588020325
0 references
0.7951358556747437
0 references
