Vertex Coloring of a Graph for Memory Constrained Scenarios
Sign Up to like & getrecommendations! Published in 2020 at "Mathematics in Computer Science"
DOI: 10.1007/s11786-019-00409-4
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… read more here.
Keywords: constrained scenarios; graph memory; coloring graph; vertex coloring ... See more keywords
Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Parallel and Distributed Systems"
DOI: 10.1109/tpds.2018.2889688
Abstract: This paper considers distributed vertex-coloring in broadcast/receive networks suffering from conflicts and collisions. (A collision occurs when, during the same round, messages are sent to the same process by too many neighbors; a conflict occurs… read more here.
Keywords: broadcast; constraints synchronous; vertex coloring; coloring communication ... See more keywords
On Coloring Catalan Number Distance Graphs and Interference Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Symmetry"
DOI: 10.3390/sym10100468
Abstract: A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an… read more here.
Keywords: distance graphs; graphs interference; vertex coloring; interference ... See more keywords