A Direct Linear-Time Planarity Test for Unflippable Modules

Amihood Amir

doi:10.1080/00207168708803570

A Direct Linear-Time Planarity Test for Unflippable Modules

Amihood Amir

University of Maryland, College Park

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

An easy and direct linear-time algorithm is provided for deciding whether there is a placement of given unflippable modules in a bounding box. such that equally labeled terminals can be connected in the plane without crossover.

Original language	English
Pages (from-to)	277-290
Number of pages	14
Journal	International Journal of Computer Mathematics
Volume	21
Issue number	3-4
DOIs	https://doi.org/10.1080/00207168708803570
State	Published - 1 Jan 1987
Externally published	Yes

Keywords

Graph planar embedding
modules
planar routing in integrated circuit layout
river routing
terminals

Access to Document

10.1080/00207168708803570

Cite this

@article{b4269ba963c743b6b2b15884dc0f5647,

title = "A Direct Linear-Time Planarity Test for Unflippable Modules",

abstract = "An easy and direct linear-time algorithm is provided for deciding whether there is a placement of given unflippable modules in a bounding box. such that equally labeled terminals can be connected in the plane without crossover.",

keywords = "Graph planar embedding, modules, planar routing in integrated circuit layout, river routing, terminals",

author = "Amihood Amir",

year = "1987",

month = jan,

day = "1",

doi = "10.1080/00207168708803570",

language = "אנגלית",

volume = "21",

pages = "277--290",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - A Direct Linear-Time Planarity Test for Unflippable Modules

AU - Amir, Amihood

PY - 1987/1/1

Y1 - 1987/1/1

N2 - An easy and direct linear-time algorithm is provided for deciding whether there is a placement of given unflippable modules in a bounding box. such that equally labeled terminals can be connected in the plane without crossover.

AB - An easy and direct linear-time algorithm is provided for deciding whether there is a placement of given unflippable modules in a bounding box. such that equally labeled terminals can be connected in the plane without crossover.

KW - Graph planar embedding

KW - modules

KW - planar routing in integrated circuit layout

KW - river routing

KW - terminals

UR - https://www.scopus.com/pages/publications/84954635849

U2 - 10.1080/00207168708803570

DO - 10.1080/00207168708803570

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84954635849

SN - 0020-7160

VL - 21

SP - 277

EP - 290

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3-4

ER -

A Direct Linear-Time Planarity Test for Unflippable Modules

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this