Presentation 1993/5/27
On Linear Arrangement Algorithms for Directed Acyclic Graphs
Kazuyoshi Takagi, Naofumi Takagi, Shuzo Yajima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The minimum cut linear arrangement problem of a graph is the problem to find a vertex ordering which minimizes the maximum edge congestion.Although this problem can be solved in polynomial time for trees,NP-complete in general. In this paper,we present two algorithms for minimum cut linear arrangement of complete p-q dags.p-q dags are a class of directed acyclic graphs often used as interconnection scheme of a class of iterative circuits. The first algorithm is based on dynamic programming.It requires time and space polynomial in the size of a given graph.The other algorithm is an approximation algorithm which ensures solution within a constant factor of the minimum. We present a systematic VLSI layout method of multiple operand adders as an application of the algorithms.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) graph / linear arrangement problem / polynomial time algorithm / VLSI layout
Paper # COMP93-18,SS93-12
Date of Issue

Conference Information
Committee COMP
Conference Date 1993/5/27(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Linear Arrangement Algorithms for Directed Acyclic Graphs
Sub Title (in English)
Keyword(1) graph
Keyword(2) linear arrangement problem
Keyword(3) polynomial time algorithm
Keyword(4) VLSI layout
1st Author's Name Kazuyoshi Takagi
1st Author's Affiliation Faculty of Engineering,Kyoto University()
2nd Author's Name Naofumi Takagi
2nd Author's Affiliation Faculty of Engineering,Kyoto University
3rd Author's Name Shuzo Yajima
3rd Author's Affiliation Faculty of Engineering,Kyoto University
Date 1993/5/27
Paper # COMP93-18,SS93-12
Volume (vol) vol.93
Number (no) 81
Page pp.pp.-
#Pages 8
Date of Issue