Improved linear problem kernel for planar connected dominating set (Q392013): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jian'er Chen / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244623 / rank
 
Normal rank
Property / zbMATH Keywords
 
data reduction
Property / zbMATH Keywords: data reduction / rank
 
Normal rank
Property / zbMATH Keywords
 
region decomposition
Property / zbMATH Keywords: region decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
kernelization
Property / zbMATH Keywords: kernelization / rank
 
Normal rank
Property / zbMATH Keywords
 
connected dominating set
Property / zbMATH Keywords: connected dominating set / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131265093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Problem Kernels for NP-Hard Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernel for Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear kernel for a planar connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Kernel for Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Improved linear problem kernel for planar connected dominating set
scientific article

    Statements

    Improved linear problem kernel for planar connected dominating set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    data reduction
    0 references
    region decomposition
    0 references
    kernelization
    0 references
    connected dominating set
    0 references

    Identifiers