Algorithm to find a maximum 2-packing set in a cactus
DOI10.1016/j.tcs.2017.11.030zbMath1391.05242OpenAlexW2772506798MaRDI QIDQ1748991
Alejandro Flores-Lamas, Joel Antonio Trejo-Sánchez, José Alberto Fernández-Zepeda
Publication date: 15 May 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.030
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum weight independent sets in classes related to claw-free graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Fundamentals of parameterized complexity
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- \(k\)-domination and \(k\)-independence in graphs: A survey
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- An exact algorithm for maximum independent set in degree-5 graphs
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Distance-\(k\) knowledge in self-stabilizing algorithms
- Algorithms for computing a parameterized \(st\)-orientation
- The obnoxious center problem on weighted cactus graphs.
- Roman domination in graphs.
- A note on greedy algorithms for the maximum weighted independent set problem
- On the complexity of the independent set problem in triangle graphs
- The maximum independent set problem in subclasses of subcubic graphs
- Efficient algorithms for center problems in cactus networks
- From matchings to independent sets
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- Easy problems for tree-decomposable graphs
- A Best Possible Heuristic for the k-Center Problem
- Graph minors. II. Algorithmic aspects of tree-width
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Linear-time computation of optimal subgraphs of decomposable graphs
- A priori optimization for the probabilistic maximum independent set problem
This page was built for publication: Algorithm to find a maximum 2-packing set in a cactus
