New properties of maximum independent set problem solution truncation rules or redundant branches

zbMATH Open0970.68106MaRDI QIDQ2737186

L. O. Aks'onova

Publication date: 11 September 2001

Published in: Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

maximum independent set problemredundant branchestruncation rules

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A sufficient condition to extend polynomial results for the maximum independent set problem 👍 👎
• On the maximum independent set problem in graphs of bounded maximum degree 👍 👎
• A new heuristic algorithm to solve the maximum independent set problem 👍 👎
• Extending the MAX algorithm for maximum independent set 👍 👎
• Using critical sets to solve the maximum independent set problem 👍 👎
• On the Power of Simple Reductions for the Maximum Independent Set Problem 👍 👎
• On Reducing Maximum Independent Set to Minimum Satisfiability 👍 👎
• Maximum independent set for intervals by divide and conquer with pruning 👍 👎
• The structure and maximum number of maximum independent sets in trees 👍 👎
• Targeted Branching for the Maximum Independent Set Problem 👍 👎

This page was built for publication: New properties of maximum independent set problem solution truncation rules or redundant branches

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