Maximum Independent Set Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2014:20, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,210 bytes +1,210‎ Created page with "Title: Maximum Independent Set Problem Research Question: How can we find the maximum independent set in a graph using an evolutionary formulation? Methodology: The researchers introduced a novel evolutionary formulation of the maximum independent set problem. They based it on the relationship between a graph's independence number and its acyclic orientations. They viewed such orientations as individuals and evolved them using evolutionary operators heavily based on th..."
Retrieved from "https://simplesci.org/wiki/Maximum_Independent_Set_Problem"