Graph optimisation problems encompass a diverse range of challenges aimed at finding optimal or near‐optimal solutions in networks or graphs. These problems are pivotal in areas such as communication ...

Problem: How many colors are needed so that if each point in the plane is assigned one of the colors, no two points which are exactly distance 1 apart will be assigned the same color? This problem has ...

The distance graph shows the height of a plane as it completes a journey. When the plane is at a height of 38,000 feet (ft), it travels at a constant speed of 550 miles per hour. The question asks how ...

The distance graph shows the height of a plane as it completes a journey. When the plane is at a height of 38,000 feet (ft), it travels at a constant speed of 550 miles per hour. Check how long the ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

In this special feature from The Exascale Report, industry thought leaders share their views on Graph computing. The Graph 500 is not new, but interest has recently been piqued as discussions are ...