Showing 1 - 4 of 4

1

An efficient algorithm for constructing Hamiltonian paths in meshes
Chen, Shao ; Shen, Hong ; Topor, Rodney William
Parallel Computing. 28:1293-1305

Sequential and parallel... Meshes Performance evaluation 0202 electrical engineer... Distributed computing an... 0102 computer and inform...
Academic journal
Save to List
2

Recognition algorithm for intersection graphs of edge disjoint paths in a tree
S. P. Mohanty ; Bhawani Sankar Panda
Information Processing Letters. 49:139-143

Analysis of algorithms a... edge-disjoint paths 0102 computer and inform... characterizations intersection graphs parallel NC algorithm
Academic journal
Save to List
3

A note on the reconstruction of a binary tree from its traversals
Gabrani, Naveen ; Shankar, Priti
Information Processing Letters. 42:117-119

binary tree Data structures Analysis of algorithms a... preorder and inorder tra... School of Automation) 0102 computer and inform...
Academic journal
Save to List
4

An efficient parallel algorithm for constructing a breadth first searching tree of a trapezoid graph
Honma, Hirotoshi

Graph theory (including... Parallel algorithms in c... linear time sequential a...
Academic journal
Save to List

Filter