Journal of Algorithms and Computation
Open Access

Home

Guide for Authors

Submit Manuscript

Reviewers

Contact Us

Keyword Index
A
  • Algorithm F5-invariant New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups [Volume 49, Issue 2, 2017, Pages 103-111]
  • Asteroidal number Asteroidal number for some product graphs [Volume 49, Issue 1, 2017, Pages 31-43]
B
  • Binary tree A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
  • Binary tree An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals [Volume 49, Issue 1, 2017, Pages 93-113]
  • Bistar Remainder Cordial Labeling of Graphs [Volume 49, Issue 1, 2017, Pages 17-30]
  • Bistar k-Remainder Cordial Graphs [Volume 49, Issue 2, 2017, Pages 41-52]
C
  • Comb Remainder Cordial Labeling of Graphs [Volume 49, Issue 1, 2017, Pages 17-30]
  • Comb k-Remainder Cordial Graphs [Volume 49, Issue 2, 2017, Pages 41-52]
  • Crown Remainder Cordial Labeling of Graphs [Volume 49, Issue 1, 2017, Pages 17-30]
  • Crown k-Remainder Cordial Graphs [Volume 49, Issue 2, 2017, Pages 41-52]
E
  • Edge-tenacity Edge-tenacity in Networks [Volume 49, Issue 1, 2017, Pages 45-53]
F
  • Fuzzy relation Linear optimization on the intersection of two fuzzy relational inequalities defined with Yager family of t-norms [Volume 49, Issue 1, 2017, Pages 55-82]
  • Fuzzy relation Linear optimization on Hamacher-fuzzy relational inequalities [Volume 49, Issue 1, 2017, Pages 115-150]
  • Fuzzy relational equations Solving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms [Volume 49, Issue 2, 2017, Pages 63-101]
G
I
  • Inorder traversal A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
  • Inorder traversal An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals [Volume 49, Issue 1, 2017, Pages 93-113]
  • Invariant Ring New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups [Volume 49, Issue 2, 2017, Pages 103-111]
K
  • Kronecker products Vibration Analysis of Global Near-regular Mechanical Systems [Volume 49, Issue 2, 2017, Pages 113-118]
M
  • Matrix operations Vibration Analysis of Global Near-regular Mechanical Systems [Volume 49, Issue 2, 2017, Pages 113-118]
  • Monomial Groups New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups [Volume 49, Issue 2, 2017, Pages 103-111]
P
  • Path k-Remainder Cordial Graphs [Volume 49, Issue 2, 2017, Pages 41-52]
  • Postorder traversal A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
  • Postorder traversal An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals [Volume 49, Issue 1, 2017, Pages 93-113]
  • Preorder traversal A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
  • Preorder traversal An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals [Volume 49, Issue 1, 2017, Pages 93-113]
  • Proper binary tree A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
S
  • SAGBI-\G basis New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups [Volume 49, Issue 2, 2017, Pages 103-111]
  • Secondary Invariant New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups [Volume 49, Issue 2, 2017, Pages 103-111]
  • Space complexity A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals [Volume 49, Issue 2, 2017, Pages 1-11]
  • Space complexity An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals [Volume 49, Issue 1, 2017, Pages 93-113]
  • Star Remainder Cordial Labeling of Graphs [Volume 49, Issue 1, 2017, Pages 17-30]
  • Star k-Remainder Cordial Graphs [Volume 49, Issue 2, 2017, Pages 41-52]
T
  • Tenacity Vulnerability Measure of a Network - a Survey [Volume 49, Issue 2, 2017, Pages 33-40]
  • Theta graph Theta Graph Designs [Volume 49, Issue 1, 2017, Pages 1-16]
V
W
  • Wheel Remainder Cordial Labeling of Graphs [Volume 49, Issue 1, 2017, Pages 17-30]