Comments on 'O(n2) algorithms for graph planarization' by R. Jayakumar et al.

Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. (ibid., vol. 8, pp. 257-267, Mar 1989) in the above-mentioned 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

Parallel algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Comments on 'O(n2) algorithms for graph planarization' by R. Jayakumar et al. / Takefuji, Yoshiyasu; Lee, Kuo Chun; Cho, Yong Beom.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 10, No. 12, 12.1991, p. 1582-1583.

Research output: Contribution to journalArticle

@article{81ef14b1466d4b6499d7d5f94f9db3ef,
title = "Comments on 'O(n2) algorithms for graph planarization' by R. Jayakumar et al.",
abstract = "The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. (ibid., vol. 8, pp. 257-267, Mar 1989) in the above-mentioned paper. The space-time product complexity is also compared.",
author = "Yoshiyasu Takefuji and Lee, {Kuo Chun} and Cho, {Yong Beom}",
year = "1991",
month = "12",
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' by R. Jayakumar et al.

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

AU - Cho, Yong Beom

PY - 1991/12

Y1 - 1991/12

N2 - The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. (ibid., vol. 8, pp. 257-267, Mar 1989) in the above-mentioned paper. The space-time product complexity is also compared.

AB - The commenters point out that their parallel algorithm provides the maximum planar subgraph, and they compare it to the maximal planar subgraph provided by R. Jayakumar et al. (ibid., vol. 8, pp. 257-267, Mar 1989) in the above-mentioned 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 - Article

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

SN - 0278-0070

IS - 12

ER -