3 votes 3 votes The upper bound of computing time of m colouring decision problem is $O(nm)$ $O(n^m)$ $O(nm^n)$ $O(n^mm^n)$ Programming in C ugcnetcse-june2012-paper3 graph-theory graph-coloring + – go_editor asked Jul 7, 2016 recategorized Nov 3, 2017 by Devshree Dubey go_editor 3.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: C ref: https://www.slideshare.net/vijaykumartripathi2008/netcsjune2012paperiii rishu_darkshadow answered Aug 29, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: C ref: https://www.slideshare.net/vijaykumartripathi2008/netcsjune2012paperiii rishu_darkshadow answered Aug 29, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.