|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
June 1981 (vol. 30 no. 6)
pp. 454
| ASCII Text | x | ||
| G. Persky, B.N. Tien, B.S. Ting, "Comments on "An Optimal Solution for the Channel-Assignment Problem"," IEEE Transactions on Computers, vol. 30, no. 6, pp. 454, June, 1981. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1981.1675816, author = {G. Persky and B.N. Tien and B.S. Ting}, title = {Comments on "An Optimal Solution for the Channel-Assignment Problem"}, journal ={IEEE Transactions on Computers}, volume = {30}, number = {6}, issn = {0018-9340}, year = {1981}, pages = {454}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1981.1675816}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Comments on "An Optimal Solution for the Channel-Assignment Problem" IS - 6 SN - 0018-9340 SP EP EPD - 454 A1 - G. Persky, A1 - B.N. Tien, A1 - B.S. Ting, PY - 1981 KW - null VL - 30 JA - IEEE Transactions on Computers ER - | |||
The main thrust of the above paper1appears to be a detailed restatement of the "left-edge algorithm" [1], [2] for channel routing. This algorithm is almost a decade old and is now quite familiar to most workers in the field of LSI design automation. That the authors did not reference this earlier work, and devoted much of their paper to a reexposition certainly detracts from its usefuln
Citation:
G. Persky, B.N. Tien, B.S. Ting, "Comments on "An Optimal Solution for the Channel-Assignment Problem"," IEEE Transactions on Computers, vol. 30, no. 6, pp. 454, June 1981, doi:10.1109/TC.1981.1675816
Usage of this product signifies your acceptance of the Terms of Use.