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

Authors:
K. J. Supowit
Affiliations:
-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 6

A dichotomy for minimum cost graph homomorphisms

European Journal of Combinatorics
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops

Discrete Applied Mathematics
A short proof of the NP-completeness of minimum sum interval coloring

Operations Research Letters
Layered interval codes for TCAM-based classification

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the approximation of minimum cost homomorphism to bipartite graphs

Discrete Applied Mathematics
On sum edge-coloring of regular, bipartite and split graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.03

Visualization

Abstract

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