| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Kryven, I.V. | |
| dc.contributor.author | Mooij, Niek | |
| dc.date.accessioned | 2022-06-16T00:00:31Z | |
| dc.date.available | 2022-06-16T00:00:31Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/41651 | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | Systems of ordinary differential equations (ODEs) are rarely thought of as a means of discrete computations. We consider finding the maximum independent set in a graph which is known to be a computationally demanding (NP-hard) problem. We show that one can construct an approximate solution to this problem by exploring the stable manifold of a particular system of ODEs by using the numerical continuation. Interestingly, our system of ODEs can be regarded as the Lotka-Volterra dynamics for competi | |
| dc.title | Generating Maximal Independent Sets Using Lotka-Volterra Dynamics | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Combinatorial Optimization, Dynamical Systems, Graph Theory, Algorithms | |
| dc.subject.courseuu | Mathematical Sciences | |
| dc.thesis.id | 4484 | |
