The document summarizes an algorithm for finding an independent dominating set of minimum cardinality in P2 + P3-free graphs in polynomial time. It first discusses related work showing the problem is NP-complete for more general graph classes. It then presents an O(n5) time algorithm that works by generating subsets S of the vertex set and using these to recursively construct candidate independent dominating sets. Key lemmas prove the algorithm's correctness and polynomial runtime.