Ananth, Prabhanjan and Dukkipati, Ambedkar (2012) Algebraic characterization of rainbow connectivity. In: Proceedings of the CASC 2012 14th International Workshop, September 3-6, 2012, Maribor, Slovenia.
|
PDF
1109.2291.pdf - Completed Version Download (133kB) | Preview |
Official URL: http://dx.doi.org/10.1007/978-3-642-32973-9_2
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.
Item Type: | Conference Paper |
---|---|
Publisher: | Springer |
Additional Information: | Copyright of this article belongs to Springer. |
Keywords: | Graphs; NulLA Alogirithm; Ideal Membership |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 27 Nov 2013 07:51 |
Last Modified: | 27 Nov 2013 07:51 |
URI: | http://eprints.iisc.ac.in/id/eprint/47824 |
Actions (login required)
View Item |