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

Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

Research output: Contribution to journalComment/debate

16 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1582-1583
Number of pages2
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume10
Issue number12
DOIs
Publication statusPublished - 1991 Dec
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

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

Cite this