Comments on “O(n2) 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
出版物ステータスPublished - 1991 12
外部発表Yes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

フィンガープリント Comments on “O(n<sup>2</sup>) Algorithms for Graph Planarization<sup>' ‘’</sup>' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用