Outerplanar Mis

Overview

🔍 Maximum Independent Set in Outerplanar Graphs An efficient algorithm to find the Maximum Independent Set (MIS) in outerplanar graphs, with brute-force comparison and performance metrics. Leverages chordal graph properties and dynamic programming for polynomial-time complexity. Includes test suite and timing analysis. Open-source project by Daniel Lozano, published on GitHub.

Highlights

• Primary language: Python
• Open source — view the code and contribute on GitHub

Built with

• Python