Restricted Permutation Layout

Sang-hyun CHOE; Toshinobu KASHIWABARA; Toshio FUJISAWA

Restricted Permutation Layout

Sang-hyun CHOE, Toshinobu KASHIWABARA, Toshio FUJISAWA

Full Text Views

0

Share
Cite this

Summary :

The paper is concerned with solutions to permutation layout problems such that i) no wire passes the upper area of the upper horizontal line, and ii) no wire intersects the lower horizontal line more than once. A necessary and sufficient condition for a problem to have such a solution is given. The set of all the solutions to the given problem is characterized in a graph theoretical way. A linear time algorithm is also given.

Publication: IEICE TRANSACTIONS on transactions Vol.E68-E No.5 pp.269-276

Publication Date: 1985/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: General

Authors

Sang-hyun CHOE
Toshinobu KASHIWABARA
Toshio FUJISAWA

Keyword

Cite this

Copy

Sang-hyun CHOE, Toshinobu KASHIWABARA, Toshio FUJISAWA, "Restricted Permutation Layout" in IEICE TRANSACTIONS on transactions, vol. E68-E, no. 5, pp. 269-276, May 1985, doi: .
Abstract: The paper is concerned with solutions to permutation layout problems such that i) no wire passes the upper area of the upper horizontal line, and ii) no wire intersects the lower horizontal line more than once. A necessary and sufficient condition for a problem to have such a solution is given. The set of all the solutions to the given problem is characterized in a graph theoretical way. A linear time algorithm is also given.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e68-e_5_269/_p

Copy

@ARTICLE{e68-e_5_269,
author={Sang-hyun CHOE, Toshinobu KASHIWABARA, Toshio FUJISAWA, },
journal={IEICE TRANSACTIONS on transactions},
title={Restricted Permutation Layout},
year={1985},
volume={E68-E},
number={5},
pages={269-276},
abstract={The paper is concerned with solutions to permutation layout problems such that i) no wire passes the upper area of the upper horizontal line, and ii) no wire intersects the lower horizontal line more than once. A necessary and sufficient condition for a problem to have such a solution is given. The set of all the solutions to the given problem is characterized in a graph theoretical way. A linear time algorithm is also given.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Restricted Permutation Layout
T2 - IEICE TRANSACTIONS on transactions
SP - 269
EP - 276
AU - Sang-hyun CHOE
AU - Toshinobu KASHIWABARA
AU - Toshio FUJISAWA
PY - 1985
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E68-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1985
AB - The paper is concerned with solutions to permutation layout problems such that i) no wire passes the upper area of the upper horizontal line, and ii) no wire intersects the lower horizontal line more than once. A necessary and sufficient condition for a problem to have such a solution is given. The set of all the solutions to the given problem is characterized in a graph theoretical way. A linear time algorithm is also given.
ER -