We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Novel Boolean Expression based Algorithm to find all possible Simple Paths between two nodes of a Graph.
- Authors
Chatterjee, Sankhadeep; Banerjee, Debarshi
- Abstract
A novel algorithm has been proposed to find all possible simple paths between any two given nodes of a graph which is a NP-hard problem. First a novel approach to represent a graph using Boolean operators has been structured. The unique Boolean expression is used to find all possible paths between any two nodes. The analysis of Boolean expression based representation of a graph reveals that the problem is in NPhard. Further a necessary and sufficient condition is given to show that the problem is not NP-complete. A detail theoretical analysis and experimental results has been given in support of its ingenuity.
- Subjects
BOOLEAN algebra; ALGEBRAIC logic; SET theory; ALGEBRAIC immunity; CARATHEODORY measure
- Publication
International Journal of Advanced Research in Computer Science, 2014, Vol 5, Issue 7, p158
- ISSN
0976-5697
- Publication type
Article