Yan, J. (1999). An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. IEEE transactions on computer-aided design of integrated circuits and systems, 18(10), 1519-1526. https://doi.org/10.1109/43.790629
Chicago Style (17th ed.) CitationYan, Jin-Tai. "An Efficient Cut-based Algorithm on Minimizing the Number of L-shaped Channels for Safe Routing Ordering." IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 18, no. 10 (1999): 1519-1526. https://doi.org/10.1109/43.790629.
MLA (9th ed.) CitationYan, Jin-Tai. "An Efficient Cut-based Algorithm on Minimizing the Number of L-shaped Channels for Safe Routing Ordering." IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, vol. 18, no. 10, 1999, pp. 1519-1526, https://doi.org/10.1109/43.790629.