مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding a Maximum Planar Subset of a Set of Nets in a Channel

DocumentCode :

914522

Title :

Finding a Maximum Planar Subset of a Set of Nets in a Channel

Author :

Supowit, Kenneth J.

Author_Institution :

Department of Computer Science, Princeton University, Princeton, NJ, USA

Volume :

Issue :

fYear :

1987

fDate :

1/1/1987 12:00:00 AM

Firstpage :

Lastpage :

Abstract :

An algorithm is presented that, given N two-pin nets in a channel, finds, in O(N²) time, the largest subset that can be routed all on one layer

Keywords :

Application software; Clocks; Computer science; Design automation; Routing; Testing;

fLanguage :

English

Journal_Title :

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher :

ieee

ISSN :

0278-0070

Type :

jour

DOI :

10.1109/TCAD.1987.1270250

Filename :

1270250

Link To Document :