{"id":82,"date":"2024-05-01T17:18:54","date_gmt":"2024-05-01T15:18:54","guid":{"rendered":"https:\/\/web.umons.ac.be\/algo\/?page_id=82"},"modified":"2026-03-31T17:38:39","modified_gmt":"2026-03-31T15:38:39","slug":"logiciels","status":"publish","type":"page","link":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/","title":{"rendered":"Logiciels d&rsquo;aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes"},"content":{"rendered":"<p>Le Service d&rsquo;Algorithmique est impliqu\u00e9 depuis sa cr\u00e9ation dans le d\u00e9veloppement d&rsquo;outils logiciels ayant pour but d&rsquo;aider les chercheurs \u00e0 trouver de nouveaux r\u00e9sultats en th\u00e9orie des graphes, et ce \u00e0 tous les niveaux du processus de la d\u00e9couverte : conjectures, preuves et contre-exemples.<\/p>\n<h2>PHOEG (et GraPHedron)<\/h2>\n<p>Le premier syst\u00e8me d\u00e9velopp\u00e9 a \u00e9t\u00e9 GraPHedron. Celui-ci utilisait une approche g\u00e9om\u00e9trique pour aider \u00e0 trouver des conjectures en th\u00e9orie extr\u00e9male des graphes. Il a \u00e9t\u00e9 aujourd&rsquo;hui remplac\u00e9 par PHOEG (acronyme de \u00ab\u00a0PHOEG Helps Obtaining Extremal Graphs\u00a0\u00bb) qui utilise toujours cette approche g\u00e9om\u00e9trique mais propose \u00e9galement une interface web interactive pour explorer les relations entre invariants de graphes.<\/p>\n<p>PHOEG est accessible \u00e0 l&rsquo;adresse <a href=\"https:\/\/phoeg.umons.ac.be\/phoeg\/\">https:\/\/phoeg.umons.ac.be\/phoeg\/<\/a>.<img loading=\"lazy\" decoding=\"async\" class=\" wp-image-213 aligncenter\" src=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png\" alt=\"\" width=\"393\" height=\"216\" srcset=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png 300w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-1024x564.png 1024w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-768x423.png 768w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-1536x846.png 1536w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-2048x1128.png 2048w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-1198x660.png 1198w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-30x17.png 30w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-60x33.png 60w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-360x198.png 360w\" sizes=\"auto, (max-width: 393px) 100vw, 393px\" \/><\/p>\n<h2>ChemicHull<\/h2>\n<p>ChemicHull est un outil sp\u00e9cifique qui offre une description polyh\u00e9drale compl\u00e8te des graphes chimiques avec un degr\u00e9 maximum au plus 3. Il permet de rapidement savoir quels sont les graphes mol\u00e9culaires qui minimisent ou maximisent un indice topologique donn\u00e9, quelqu&rsquo;il soit, m\u00eame d\u00e9fini en ligne par l&rsquo;utilisateur. Il est accessible via <a href=\"https:\/\/phoeg.umons.ac.be\/chemichull\">https:\/\/phoeg.umons.ac.be\/chemichull<\/a><\/p>\n<h2>House of Graphs<\/h2>\n<p>Des chercheurs du service d&rsquo;Algorithmique sont impliqu\u00e9s dans la cr\u00e9ation d&rsquo;House of Graphs (version initiale et nouvelle version). Ce site web utilis\u00e9 par plus de 500 utilisateurs enr\u00e9gistr\u00e9s est une base de donn\u00e9es ouvertes de graphes int\u00e9ressants.<\/p>\n<p>House of Graphs est accessible \u00e0 l&rsquo;adresse <a href=\"https:\/\/houseofgraphs.org\/\">https:\/\/houseofgraphs.org<\/a>.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\" wp-image-87 aligncenter\" src=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/05\/hog-house.png\" alt=\"\" width=\"158\" height=\"103\" srcset=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/05\/hog-house.png 86w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/05\/hog-house-30x20.png 30w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/05\/hog-house-60x39.png 60w\" sizes=\"auto, (max-width: 158px) 100vw, 158px\" \/><\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Le Service d&rsquo;Algorithmique est impliqu\u00e9 depuis sa cr\u00e9ation dans le d\u00e9veloppement d&rsquo;outils logiciels ayant pour but d&rsquo;aider les chercheurs \u00e0 trouver de nouveaux r\u00e9sultats en th\u00e9orie des graphes, et ce \u00e0 tous les niveaux du processus de la d\u00e9couverte : conjectures, preuves et contre-exemples. PHOEG (et GraPHedron) Le premier syst\u00e8me d\u00e9velopp\u00e9 a \u00e9t\u00e9 GraPHedron. Celui-ci [&hellip;]<\/p>\n","protected":false},"author":130,"featured_media":0,"parent":15,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-82","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.2 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Logiciels d&#039;aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Logiciels d&#039;aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique\" \/>\n<meta property=\"og:description\" content=\"Le Service d&rsquo;Algorithmique est impliqu\u00e9 depuis sa cr\u00e9ation dans le d\u00e9veloppement d&rsquo;outils logiciels ayant pour but d&rsquo;aider les chercheurs \u00e0 trouver de nouveaux r\u00e9sultats en th\u00e9orie des graphes, et ce \u00e0 tous les niveaux du processus de la d\u00e9couverte : conjectures, preuves et contre-exemples. PHOEG (et GraPHedron) Le premier syst\u00e8me d\u00e9velopp\u00e9 a \u00e9t\u00e9 GraPHedron. Celui-ci [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\" \/>\n<meta property=\"og:site_name\" content=\"Service \/ FS - Algorithmique\" \/>\n<meta property=\"article:modified_time\" content=\"2026-03-31T15:38:39+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-scaled.png\" \/>\n\t<meta property=\"og:image:width\" content=\"2560\" \/>\n\t<meta property=\"og:image:height\" content=\"1411\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\",\"url\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\",\"name\":\"Logiciels d'aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique\",\"isPartOf\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png\",\"datePublished\":\"2024-05-01T15:18:54+00:00\",\"dateModified\":\"2026-03-31T15:38:39+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#breadcrumb\"},\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage\",\"url\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png\",\"contentUrl\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/web.umons.ac.be\/algo\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Activit\u00e9s de recherche\",\"item\":\"https:\/\/web.umons.ac.be\/algo\/recherche\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Logiciels d&rsquo;aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/#website\",\"url\":\"https:\/\/web.umons.ac.be\/algo\/\",\"name\":\"Service \/ FS - Algorithmique\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/web.umons.ac.be\/algo\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"fr-FR\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Logiciels d'aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/","og_locale":"fr_FR","og_type":"article","og_title":"Logiciels d'aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique","og_description":"Le Service d&rsquo;Algorithmique est impliqu\u00e9 depuis sa cr\u00e9ation dans le d\u00e9veloppement d&rsquo;outils logiciels ayant pour but d&rsquo;aider les chercheurs \u00e0 trouver de nouveaux r\u00e9sultats en th\u00e9orie des graphes, et ce \u00e0 tous les niveaux du processus de la d\u00e9couverte : conjectures, preuves et contre-exemples. PHOEG (et GraPHedron) Le premier syst\u00e8me d\u00e9velopp\u00e9 a \u00e9t\u00e9 GraPHedron. Celui-ci [&hellip;]","og_url":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/","og_site_name":"Service \/ FS - Algorithmique","article_modified_time":"2026-03-31T15:38:39+00:00","og_image":[{"width":2560,"height":1411,"url":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-scaled.png","type":"image\/png"}],"twitter_card":"summary_large_image","twitter_misc":{"Dur\u00e9e de lecture estim\u00e9e":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/","url":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/","name":"Logiciels d'aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes - Service \/ FS - Algorithmique","isPartOf":{"@id":"https:\/\/web.umons.ac.be\/algo\/#website"},"primaryImageOfPage":{"@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage"},"image":{"@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage"},"thumbnailUrl":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png","datePublished":"2024-05-01T15:18:54+00:00","dateModified":"2026-03-31T15:38:39+00:00","breadcrumb":{"@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#breadcrumb"},"inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/"]}]},{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#primaryimage","url":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png","contentUrl":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2026\/03\/phoeg_example-300x165.png"},{"@type":"BreadcrumbList","@id":"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/web.umons.ac.be\/algo\/"},{"@type":"ListItem","position":2,"name":"Activit\u00e9s de recherche","item":"https:\/\/web.umons.ac.be\/algo\/recherche\/"},{"@type":"ListItem","position":3,"name":"Logiciels d&rsquo;aide \u00e0 la d\u00e9couverte en th\u00e9orie des graphes"}]},{"@type":"WebSite","@id":"https:\/\/web.umons.ac.be\/algo\/#website","url":"https:\/\/web.umons.ac.be\/algo\/","name":"Service \/ FS - Algorithmique","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/web.umons.ac.be\/algo\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"fr-FR"}]}},"lang":"fr","translations":{"fr":82,"en":97},"pll_sync_post":[],"_links":{"self":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/82","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/users\/130"}],"replies":[{"embeddable":true,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/comments?post=82"}],"version-history":[{"count":3,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/82\/revisions"}],"predecessor-version":[{"id":214,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/82\/revisions\/214"}],"up":[{"embeddable":true,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/15"}],"wp:attachment":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/media?parent=82"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}