相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A distributed algorithm for a maximal 2-packing set in Halin graphs
Alejandro Flores-Lamas et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2020)
A Parallel Algorithm for Matheuristics: A Comparison of Optimization Solvers
Martin Gonzalez et al.
ELECTRONICS (2020)
Algorithm to find a maximum 2-packing set in a cactus
Alejandro Flores-Lamas et al.
THEORETICAL COMPUTER SCIENCE (2018)
A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
Joel Antonio Trejo-Sanchez et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2017)
Finding near-optimal independent sets at scale
Sebastian Lamm et al.
JOURNAL OF HEURISTICS (2017)
Approximating the minimum hub cover problem on planar graphs
Belma Yelbay et al.
OPTIMIZATION LETTERS (2016)
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Joel Antonio Trejo-Sanchez et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2014)
Self-Stabilizing Algorithm for Maximal 2-packing with Safe Convergence in an Arbitrary Graph
Yihua Ding et al.
PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) (2014)
Metaheuristics: review and application
Anupriya Gogna et al.
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE (2013)
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Zhengnan Shi
INFORMATION PROCESSING LETTERS (2012)
Efficient transformation of distance-2 self-stabilizing algorithms
Volker Turau
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2012)
A Self-stabilizing Algorithm for the Maximal 2-packing in a Cactus Graph
Joel Antonio Trejo-Sanchez et al.
2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW) (2012)
Distance-k knowledge in self-stabilizing algorithms
Wayne Goddard et al.
THEORETICAL COMPUTER SCIENCE (2008)
NP-hard graph problems and boundary classes of graphs
V. E. Alekseev et al.
THEORETICAL COMPUTER SCIENCE (2007)
Dominating sets in planar graphs: Branch-width and exponential speed-up
Fedor V. Fomin et al.
SIAM JOURNAL ON COMPUTING (2006)
Approximating maximum clique by removing subgraphs
U Feige
SIAM JOURNAL ON DISCRETE MATHEMATICS (2004)
Independent sets with domination constraints
MM Halldórsson et al.
DISCRETE APPLIED MATHEMATICS (2000)
分享论文
