|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Property of N-Graphs
January 1971 (vol. 20 no. 1)
pp. 95-97
| ASCII Text | x | ||
| A. Hashimoto, K. Noshita, "A Property of N-Graphs," IEEE Transactions on Computers, vol. 20, no. 1, pp. 95-97, January, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223085, author = {A. Hashimoto and K. Noshita}, title = {A Property of N-Graphs}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {1}, issn = {0018-9340}, year = {1971}, pages = {95-97}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223085}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Property of N-Graphs IS - 1 SN - 0018-9340 SP95 EP97 EPD - 95-97 A1 - A. Hashimoto, A1 - K. Noshita, PY - 1971 KW - Crosspoint minimization KW - design automation KW - graph theory KW - integrated circuits KW - printed circuits. VL - 20 JA - IEEE Transactions on Computers ER - | |||
T. A. J. Nicholson has introduced a restricted class of drawn graphs (N-graphs) into the problem of drawing a graph with a minimum number of crosspoints. This short note shows some defects in representing the capability of N-graphs by presenting a planar graph which cannot be represented by any N-graphs.
Index Terms:
Crosspoint minimization, design automation, graph theory, integrated circuits, printed circuits.
Citation:
A. Hashimoto, K. Noshita, "A Property of N-Graphs," IEEE Transactions on Computers, vol. 20, no. 1, pp. 95-97, Jan. 1971, doi:10.1109/T-C.1971.223085
Usage of this product signifies your acceptance of the Terms of Use.