Using A* algorithm for directed linear arrangement problem

Authors:
Derchian Tsaih;Guangming Wu;Shaoshin Hung;Chinshan Wu
Affiliations:
Nanhua University, Department of Electronic Commerce Management, Dalin, Chiayi, Taiwan;Nanhua University, Department of Information Management, Dalin, Chiayi, Taiwan;Wufeng Institute of Technology, Department of CS, Minsyong, Chiayi, Taiwan;Wufeng Institute of Technology, Department of CS, Minsyong, Chiayi, Taiwan
Venue:
MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Year:
2008

Citing 3
Cited 0

A dynamic task scheduling algorithm in grid environment

TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
A critical predecessor duplication scheduling algorithm for distributed heterogeneous computing environments

TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
An efficient broadcast scheme for wireless data schedule under a new data affinity model

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel A* algorithm to solve the Directed Linear Arrangement Problem. By using a branch and bound technique to embed a given directed acyclic graph into a layerwise partition search graph, the optimal directed ordering is then be identified through a A* shortest path search in the embedding graph. In order to reduce the memory requirement of the A* search, we also discuss a implementation of the relay node technique from Zhou [11].