Journal of Algorithms and ComputationJournal of Algorithms and Computation
https://jac.ut.ac.ir/
Thu, 16 Aug 2018 11:27:15 +0100FeedCreatorJournal of Algorithms and Computation
https://jac.ut.ac.ir/
Feed provided by Journal of Algorithms and Computation. Click to visit.Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of ...
https://jac.ut.ac.ir/article_7989_117.html
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative version of Gutman index of cartesian product of two connected graphs. And we compute the exact value for the cartesian product of two complete graphs. Using this result, we prove that our bound is tight. Also, we obtain the sharp upper bound for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of connected and complete graphs. And we observe the exact value for the strong product of two complete graphs. From this, we prove that our bound is tight.Thu, 31 May 2018 19:30:00 +0100An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
https://jac.ut.ac.ir/article_67033_117.html
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of $ BigO{emph{n}^2} $. In this paper, we present $ proc{InPos} $ an improved algorithm to reconstruct a binary tree from its inorder and postorder traversals. The running time and space complexity of the algorithm are an order of $ BigTheta{emph{n}} $ and $ BigTheta{emph{n}} $ respectively, which we prove to be optimal.Thu, 31 May 2018 19:30:00 +0100