Comments on "O(n/sup 2/) algorithms for graph planarization

Comments on "O(n/sup 2/) algorithms for graph planarization

For the original article see ibid., vol.8, no.3, p.257-67 (1989). 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. in the above-mentioned paper. The space-time product compl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 1991-12, Vol.10 (12), p.1582-1583
Hauptverfasser: Takefuji, Y., Lee, K.C., Cho, Y.B.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computational modeling
Design automation
Electronics
Exact sciences and technology
Hardware
Parallel algorithms
Planarization
Printed circuits
Routing
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For the original article see ibid., vol.8, no.3, p.257-67 (1989). 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. in the above-mentioned paper. The space-time product complexity is also compared.< >
ISSN:0278-0070
1937-4151
DOI:10.1109/43.103509