TY - GEN

T1 - Cell flipping in permutation diagrams

AU - Golumbic, Martin Charles

AU - Kaplang, Haim

PY - 1998

Y1 - 1998

N2 - Permutation diagrams have been used in circuit design to model a set of single point nets crossing a channel, where the minimum number of layers needed to realize the diagram equals the clique number ω(G) of its permutation graph, the value of which can be calculated in O(n log n) time. We consider a generalization of this model motivated by "standard cell" technology in which the numbers on each side of the channel are partitioned into consecutive subsequences, or cells, each of which can be left unchanged or flipped (i.e., reversed). We ask, for what choice of fiippings will the resulting clique number be minimum or maximum. We show that when one side of the channel is fixed (no flipping), an optimal flipping for the other side can be found in O(n log n) time for the maximum clique number. We prove that the general problem is NP-complete for the minimum clique number and O(n 2) for the maximum clique number. Moreover, since the complement of a permutation graph is also a permutation graph, the same complexity results hold for the independence number.

AB - Permutation diagrams have been used in circuit design to model a set of single point nets crossing a channel, where the minimum number of layers needed to realize the diagram equals the clique number ω(G) of its permutation graph, the value of which can be calculated in O(n log n) time. We consider a generalization of this model motivated by "standard cell" technology in which the numbers on each side of the channel are partitioned into consecutive subsequences, or cells, each of which can be left unchanged or flipped (i.e., reversed). We ask, for what choice of fiippings will the resulting clique number be minimum or maximum. We show that when one side of the channel is fixed (no flipping), an optimal flipping for the other side can be found in O(n log n) time for the maximum clique number. We prove that the general problem is NP-complete for the minimum clique number and O(n 2) for the maximum clique number. Moreover, since the complement of a permutation graph is also a permutation graph, the same complexity results hold for the independence number.

UR - http://www.scopus.com/inward/record.url?scp=21944456983&partnerID=8YFLogxK

U2 - 10.1007/BFb0028592

DO - 10.1007/BFb0028592

M3 - Conference contribution

AN - SCOPUS:21944456983

SN - 3540642307

SN - 9783540642305

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 577

EP - 586

BT - STACS 98 - 15th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

T2 - 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98

Y2 - 25 February 1998 through 27 February 1998

ER -