{"id":97,"date":"2024-05-01T17:53:51","date_gmt":"2024-05-01T15:53:51","guid":{"rendered":"https:\/\/web.umons.ac.be\/algo\/?page_id=97"},"modified":"2024-12-18T15:42:51","modified_gmt":"2024-12-18T14:42:51","slug":"software","status":"publish","type":"page","link":"https:\/\/web.umons.ac.be\/algo\/en\/research\/software\/","title":{"rendered":"Software for Discovery in Graph Theory"},"content":{"rendered":"
The Algorithms Lab has been involved since its creation in the development of software tools aimed at helping researchers find new results in graph theory, at all levels of the discovery process: conjectures, proofs and counterexamples.<\/p>\n
The first system developed was GraPHedron. It used a geometric approach to help find conjectures in extremal graph theory. It has today been replaced by PHOEG (acronym for \u00ab\u00a0PHOEG Helps Obtaining Extremal Graphs\u00a0\u00bb) which still uses this geometric approach but also offers an interactive web interface to explore the relationships between graph invariants.<\/p>\n