LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Vertex Coloring of a Graph for Memory Constrained Scenarios

Given an undirected graph $$G=(V,E)$$ G = ( V , E ) , where V is a set of n vertices and E is a set of m edges, the… Click to show full abstract

Given an undirected graph $$G=(V,E)$$ G = ( V , E ) , where V is a set of n vertices and E is a set of m edges, the vertex coloring problem consists in assigning colors to the graph vertices such that no two adjacent vertices share the same color. The vertex coloring problem has several practical applications, for instance, resource scheduling, compiler register allocation, pattern matching, puzzle solving, exam timetabling, among others. It is known that the problem of vertex k -coloring of a graph, for any $$k \ge 3$$ k ≥ 3 , is NP-complete. In this work, we focus on an approximate solution that can be implemented on simple electronic equipments that do not require a complete set of operations present in common microprocessors. The solution is suitable for sensors and other devices present in several applications for collecting and measuring data.

Keywords: constrained scenarios; graph memory; coloring graph; vertex coloring; memory constrained; problem

Journal Title: Mathematics in Computer Science
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.