Experiments on data reduction for optimal domination in networks
- 21 June 2006
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 146 (1), 105-117
- https://doi.org/10.1007/s10479-006-0045-4
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-UpSIAM Journal on Computing, 2006
- A refined search tree technique for Dominating Set on planar graphsJournal of Computer and System Sciences, 2005
- Improved Algorithms and Complexity Results for Power Domination in GraphsLecture Notes in Computer Science, 2005
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel SizeLecture Notes in Computer Science, 2005
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- The origin of power laws in Internet topologies revisitedPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Domination in Graphs Applied to Electric Power NetworksSIAM Journal on Discrete Mathematics, 2002
- BIND--The Biomolecular Interaction Network DatabaseNucleic Acids Research, 2001
- A threshold of ln n for approximating set coverJournal of the ACM, 1998