Algebraic and Combinatorial Algorithms for S-Packing Coloring
Copyright policy )Algebraic and Combinatorial Algorithms for S-Packing Coloring
S -packing coloring is a generalization of proper coloring of graphs, introduced more than a decade ago. In this paper, we present algebraic and combinatorial algorithms for the problem of S -packing coloring of finite undirected and unweighted graphs. We assess the upper bounds for the complexity of our algorithms and of an existing algebraic algorithm by Maarouf [Electron. J. Combin. 2017]. We also provide a comparative evaluation of these algorithms.
Coloring of graphs and hypergraphs, Solving polynomial systems; resultants, zero dimensional ideal, Shape's lemma, \(S\)-packing colorings, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Gröbner basis
Coloring of graphs and hypergraphs, Solving polynomial systems; resultants, zero dimensional ideal, Shape's lemma, \(S\)-packing colorings, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Gröbner basis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!