An Optimized Algorithm for Solving Combinatorial Problems using Reference Graph

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3

Abstract

 Abstract: In this paper a novel optimized graph referencing method is proposed to tackle combinatorial problems with greater ease. The proposed algorithm is a modification of the existing backtracking algorithm. It takes into account the advantage of backtrack algorithm while eliminating its disadvantages. Special care has been taken to reduce the time complexity in avoiding frequent unsuccessful searches and in providing accurate and fast solution to the targeted sub problem. The theoretical analysis and experimental results presented reveal the superiority of proposed algorithm over the conventional algorithms

Authors and Affiliations

Raktim Chakraborty , Saubhik Paladhi , Sankhadeep Chatterjee , Soumen Banerjee

Keywords

Related Articles

 Cloud Computing: Overview & Utility

 Abstract: Cloud computing enables the process of storing documents, files photos online instead of using homecomputer, or webmail or a social networking site. If in an organization, it is desired to use an online i...

 Real-time Moving Object Detection using SURF

Abstract: Tracking and traffic monitoring are main application of moving Object detection in video. This paperpresents SURF (Speed-Up Robust Features) algorithm and real-time detection of objects using frame difference.T...

 Privacy Security of Multiuser on Multilevel System using XOR

Abstract: Privacy security of multiuser on multilevel system is considered in this work. On communication there is a chance for the eavesdropper’s to secretly listen to the conversation. In order to confuse the eavesdrop...

 Pose Invariant Face Recognition using Neuro-Fuzzy Approach

 Abstract : In this paper a pose invariant face recognition using neuro-fuzzy approach is proposed. Hereadaptive neuro fuzzy interface system (ANFIS) classifier is used as neuro-fuzzy approach for pose invariant fac...

 An approach for human gait identification based on area

 In recent investigations related to security issues, biometrics plays an important role in recognition of individuals based on their physiological or behavioral characteristics. Gait as a biometric behavioral tra...

Download PDF file
  • EP ID EP157828
  • DOI 10.9790/0661-16330107
  • Views 90
  • Downloads 0

How To Cite

Raktim Chakraborty, Saubhik Paladhi, Sankhadeep Chatterjee, Soumen Banerjee (2014).  An Optimized Algorithm for Solving Combinatorial Problems using Reference Graph. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 1-7. https://europub.co.uk/articles/-A-157828