An efficient A* algorithm for the directed linear arrangement problem

Authors:
Derchian Tsaih;Guangming Wu;Chiehyao Chang;Shaoshin Hung;Chinshan Wu;Huiling Lin
Affiliations:
Nanhua University, Department of E-Commerce, Dalin, Chiayi, Taiwan;Nanhua University, Department of Information Management, Dalin, Chiayi, Taiwan;Nanhua University, Department of E-Commerce, Dalin, Chiayi, Taiwan;Wufeng Institute of Technology, Department of CS, Chiayi, Taiwan;Wufeng Institute of Technology, Department of E-Commerce, Chiayi, Taiwan;Ling Tung University, Department of International Business, Taichung, Taiwan
Venue:
WSEAS Transactions on Computers
Year:
2008

Citing 11
Cited 0

Global min-cuts in RNC, and other ramifications of a simple min-out algorithm

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Data clustering: a review

ACM Computing Surveys (CSUR)
Data Structures and Algorithms

Data Structures and Algorithms
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An efficient broadcast data clustering method for multipoint queries in wireless information systems

Journal of Systems and Software
Scheduling Algorithms for a Fork DAG in a NOWs

HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Combinatorial optimization: mutual relations among graph algorithms

WSEAS Transactions on Mathematics
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
Efficient and effective placement for very large circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an efficient 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. We developed a hybrid DC+BDS algorithm to approximate the optimal linear arrangement solution, which includes directed clustering and bidirectional sort technique. Along with a lower bound based on the maximum flow technique, this approximation solution is used as an upper bound to prune the state space during the A* search. In order to reduce the memory requirement of the A* search, we also discuss a implementation of the relay node technique from Zhou and Hansen [22].