Skip to content

Author

Satyanarayana Sanakkayala

We have 3 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access 2009

A Programming Approach to Planar Coloured Graphs

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 · 0 citations
Open access 2009

Novel Graph Machine Learning Algorithms on Planar Coloured Graphs

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 · 0 citations
Open access 2009

Graph Machine Learning on Planar Graphs

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 · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.