Algorithm to find a maximum 2-packing set in a cactus
From MaRDI portal
Recommendations
- A linear algorithm for finding a minimum dominating set in a cactus
- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- scientific article; zbMATH DE number 2114409
- scientific article; zbMATH DE number 786556
- scientific article; zbMATH DE number 1629820
- An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs
- A fast algorithm for the path 2-packing problem
- A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- scientific article; zbMATH DE number 3926962
Cites work
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- A note on greedy algorithms for the maximum weighted independent set problem
- A priori optimization for the probabilistic maximum independent set problem
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Algorithms for computing a parameterized \(st\)-orientation
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An algorithm for the maximum weight independent set problem on outerstring graphs
- An exact algorithm for maximum independent set in degree-5 graphs
- Distance-\(k\) knowledge in self-stabilizing algorithms
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- Easy problems for tree-decomposable graphs
- Efficient algorithms for center problems in cactus networks
- Efficient transformation of distance-2 self-stabilizing algorithms
- From matchings to independent sets
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- Introduction to algorithms.
- Linear-time computation of optimal subgraphs of decomposable graphs
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- Maximum weight independent sets in classes related to claw-free graphs
- On the complexity of the independent set problem in triangle graphs
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Roman domination in graphs.
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- The maximum independent set problem in subclasses of subcubic graphs
- The obnoxious center problem on weighted cactus graphs.
- Topics in graph theory. Graphs and their Cartesian product
- Weighted independent sets in a subclass of P₆-free graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
Cited in
(4)- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- A genetic algorithm for the maximum 2-packing set problem
- An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs
This page was built for publication: Algorithm to find a maximum 2-packing set in a cactus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748991)
