Martin Charles Golumbic, Haim Kaplan, Elad Verbin  Home/Search
Context
Related
| cri.haifa.ac.il/te...ll_flipping0901.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cri.haifa.ac.il...chnical_reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 ... (Update)
Similar documents based on text: More All
0.6: Cell Flipping in Permutation Diagrams - Golumbic, Kaplan (2001) (Correct)
0.2: Algorithms and Complexity of Sandwich Problems in Graphs.. - Golumbic, Kaplan, Shamir (1994) (Correct)
0.2: Graph Sandwich Problems - Golumbic, Kaplan, Shamir (1994) (Correct)
BibTeX entry: (Update)
@inproceedings{ golumbic98cell,
author = "Martin Charles Golumbic and Haim Kaplan",
title = "Cell Flipping in Permutation Diagrams",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "577-586",
year = "1998",
url = "citeseer.ist.psu.edu/golumbic03cell.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson - 1979
488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1990
21 On computing the length of longest increasing subsequences (context) - Fredman - 1975
16 The multiple-choice knapsack problem (context) - Sinha, Zoltners - 1979
9 Some matching problems for bipartite graphs (context) - Itai, Rodeh et al. - 1978
7 a scheduling problem where a job can be executed only by a l.. (context) - Chang, Lee - 1988
7 Algorithms for integrated circuit layout: an analytic approa.. (context) - LaPaugh - 1980
3 Optimal cell ipping to minimize channel density in VLSI desi.. (context) - Boros, Hammer et al. - 1999
3 Cell ipping in permutation diagrams (context) - Golumbic, Kaplan - 1998
2 Scheduling unit-time jobs on processors with di erent capabi.. (context) - Chen, Chin - 1989
Documents on the same site (http://www.cri.haifa.ac.il/technical_reports.htm): More
The Recognition of k-EPT Graphs - Golumbic, Lipshteyn, Stern (Correct)
Factoring and Recognition of Read-Once Functions Using.. - Golumbic, Mintz, Rotics (2004) (Correct)
An Extension of the Greene and Greene-Kleitman Theorems to all.. - Hartman (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC