Two Danish computer scientists have successfully resolved a long-standing math puzzle that had been mystifying the researchers for decades. After a last algorithmic progression in the 1990s, no significant progress has been made in this puzzle for decades. The general problem in question is part of the so-called graph theory and associates in particular to the difficulty of determining an algorithm to resolve the planarity of a dynamic graph. This is exceptional because the same hurdles encountered with something as conceptually simple as the three utility problem arises in areas such as microchip design or street planning, which includes many more cornerstones than just three houses and three utilities become more mysterious.
Disclaimer: The above article has been aggregated by a computer program and summarised by an Steamdaily specialist. You can read the original article at sciencealert
