In this letter, we consider the following problem: Given a weighted digraph G=[V, Ea
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kunihiko ISHIMA, Shuji TSUKIYAMA, "On an Algorithm to Detect Positive Cycles in a Constraint Graph for Layout Compaction" in IEICE TRANSACTIONS on Fundamentals,
vol. E74-A, no. 11, pp. 3613-3616, November 1991, doi: .
Abstract: In this letter, we consider the following problem: Given a weighted digraph G=[V, Ea
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_11_3613/_p
Copy
@ARTICLE{e74-a_11_3613,
author={Kunihiko ISHIMA, Shuji TSUKIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On an Algorithm to Detect Positive Cycles in a Constraint Graph for Layout Compaction},
year={1991},
volume={E74-A},
number={11},
pages={3613-3616},
abstract={In this letter, we consider the following problem: Given a weighted digraph G=[V, Ea
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - On an Algorithm to Detect Positive Cycles in a Constraint Graph for Layout Compaction
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3613
EP - 3616
AU - Kunihiko ISHIMA
AU - Shuji TSUKIYAMA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1991
AB - In this letter, we consider the following problem: Given a weighted digraph G=[V, Ea
ER -