The proof of the four colour theorem is a landmark of computational mathematics, and its
machinery, degeneracy, Kempe chains, discharging, reducibility, and unavoidable sets, is a treasury of al-
gorithmic ideas. This paper, the third in a series on learning and computing with planar graphs, takes
a programming approac...
Satyanarayana Sanakkayala· International Journal of Com...· 0 citations
Four novel algorithms are proposed that make colour a first class citizen of graph machine learning on planar structures and show that on planar coloured graphs the chromatic structure is not a nuisance to be hashed away but a schedule, a feature, and a coarsening all at once.
Satyanarayana Sanakkayala· International Journal of Com...· 0 citations
Graph machine learning tailored to planar graphs is developed, with an emphasis on the mathematical intuition that connects the topology of a plane embedding to the spectral and combinatorial structure ex- ploited by learning algorithms.
Satyanarayana Sanakkayala· International Journal of Com...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.