Comments on “O(n2) Algorithms for Graph Planarization' ‘’

Yoshiyasu Takefuji; Kuo Chun Lee; Yong Beom Cho

doi:10.1109/43.103509

Comments on “O(n²) Algorithms for Graph Planarization^{' ‘’}

Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

研究成果: Comment/debate › 査読

16 被引用数 (Scopus)

抄録

This article points out that our parallel algorithm provides the maximum planar subgraph and it is compared with the maximal planar subgraph provided by Jayakumar et al. in the above paper. The space-time product complexity is also compared.

本文言語	English
ページ（範囲）	1582-1583
ページ数	2
ジャーナル	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
巻	10
号	12
DOI	https://doi.org/10.1109/43.103509
出版ステータス	Published - 1991 12月
外部発表	はい

ASJC Scopus subject areas

ソフトウェア
コンピュータグラフィックスおよびコンピュータ支援設計
電子工学および電気工学

文献へのアクセス

10.1109/43.103509

他のファイルとリンク

引用スタイル

@article{81ef14b1466d4b6499d7d5f94f9db3ef,

title = "Comments on “O(n2) Algorithms for Graph Planarization' {\textquoteleft}{\textquoteright}",

abstract = "This article points out that our parallel algorithm provides the maximum planar subgraph and it is compared with the maximal planar subgraph provided by Jayakumar et al. in the above paper. The space-time product complexity is also compared.",

author = "Yoshiyasu Takefuji and Lee, {Kuo Chun} and Cho, {Yong Beom}",

year = "1991",

month = dec,

doi = "10.1109/43.103509",

language = "English",

volume = "10",

pages = "1582--1583",

journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",

issn = "0278-0070",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - Comments on “O(n2) Algorithms for Graph Planarization' ‘’

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

AU - Cho, Yong Beom

PY - 1991/12

Y1 - 1991/12

N2 - This article points out that our parallel algorithm provides the maximum planar subgraph and it is compared with the maximal planar subgraph provided by Jayakumar et al. in the above paper. The space-time product complexity is also compared.

AB - This article points out that our parallel algorithm provides the maximum planar subgraph and it is compared with the maximal planar subgraph provided by Jayakumar et al. in the above paper. The space-time product complexity is also compared.

UR - http://www.scopus.com/inward/record.url?scp=0026396074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026396074&partnerID=8YFLogxK

U2 - 10.1109/43.103509

DO - 10.1109/43.103509

M3 - Comment/debate

AN - SCOPUS:0026396074

SN - 0278-0070

VL - 10

SP - 1582

EP - 1583

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IS - 12

ER -