• DocumentCode
    1609646
  • Title

    Single row routing with bounded number of doglegs per net

  • Author

    Deogun, Jitender S. ; Roy, Arnob ; Sherwani, Naveed A.

  • Author_Institution
    Dept. of Comput. Sci., Nebraska Univ., Lincoln, NE, USA
  • fYear
    1989
  • Firstpage
    43
  • Abstract
    Sufficient and necessary conditions are presented for single-row routing when the number of doglegs per net is bounded by K, K=1, 2. Algorithms for finding such realizations are developed. The necessary and sufficient conditions are based on a graph theoretic representation, in which an instance of the single-row routing problem is represented by three graphs: an overlap graph, a containment graph, and an interval graph
  • Keywords
    circuit layout CAD; printed circuit design; bounded number of doglegs per net; containment graph; graph theoretic representation; interval graph; necessary and sufficient conditions; overlap graph; single-row routing; Computer science; Heuristic algorithms; Integrated circuit interconnections; Nonhomogeneous media; Printed circuits; Routing; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1989., IEEE International Symposium on
  • Conference_Location
    Portland, OR
  • Type

    conf

  • DOI
    10.1109/ISCAS.1989.100288
  • Filename
    100288
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1609646