Abstract
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.
Author supplied keywords
Cite
CITATION STYLE
Ananth, P., & Dukkipati, A. (2012). An algebraic characterization of rainbow connectivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7442 LNCS, pp. 12–21). Springer Verlag. https://doi.org/10.1007/978-3-642-32973-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
