On the maximum weighted irredundant set problem

DOI10.33044/REVUMA.3349MaRDI QIDQ6919592zbMATH OpenFDO

Authors Ricardo D. Katz, D. Severín

Publication date 8 October 2025

Published in Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33044/REVUMA.3349

zbMATH Keywords

heuristicmaximum weighted irredundant setpolynomial time

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Cites work

• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• An introduction to small scale reflection in Coq
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability
• Formal proof - the four color theorem
• Formal proof -- theory and practice
• Formalization of the Domination Chain with Weighted Parameters (Short Paper)
• Graph theory in Coq: minors, treewidth, and isomorphisms
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1786225 (Why is no real title available?)
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• On maximal independent sets of vertices in claw-free graphs
• Parameterized algorithms
• Properties of Hereditary Hypergraphs and Middle Graphs
• The complexity of irredundant sets parameterized by size
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Total irredundance in graphs
• Weighted upper domination number

This page was built for publication: On the maximum weighted irredundant set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6919592)