Targeted Branching for the Maximum Independent Set Problem

Demian Hespe, Sebastian Lamm, Christian Schorr

Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinal…