{"version":"1.0","provider_name":"Service \/ FS - Algorithmique","provider_url":"https:\/\/web.umons.ac.be\/algo","author_name":"Hadrien M\u00e9lot","author_url":"https:\/\/web.umons.ac.be\/algo\/author\/hmelot\/","title":"Software for Discovery in Graph Theory - Service \/ FS - Algorithmique","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"eqfcaiC9eT\"><a href=\"https:\/\/web.umons.ac.be\/algo\/en\/research\/software\/\">Software for Discovery in Graph Theory<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/web.umons.ac.be\/algo\/en\/research\/software\/embed\/#?secret=eqfcaiC9eT\" width=\"600\" height=\"338\" title=\"\u00ab\u00a0Software for Discovery in Graph Theory\u00a0\u00bb &#8212; Service \/ FS - Algorithmique\" data-secret=\"eqfcaiC9eT\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script type=\"text\/javascript\">\n\/* <![CDATA[ *\/\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/web.umons.ac.be\/algo\/wp-includes\/js\/wp-embed.min.js\n\/* ]]> *\/\n<\/script>\n","description":"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. GraPHedron &amp; PHOEG The first system developed was GraPHedron. It used a geometric approach to help find conjectures in [&hellip;]","thumbnail_url":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/05\/Image-01-05-2024-at-14.38-300x155.jpg"}