Single row routing with bounded number of doglegs per net

Jitender S Deogun, Arnob Roy, Naveed A. Sherwani

Research output: Contribution to journalConference article

2 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)43-46
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume1
StatePublished - Dec 1 1989
EventIEEE International Symposium on Circuits and Systems 1989, the 22nd ISCAS. Part 1 - Portland, OR, USA
Duration: May 8 1989May 11 1989

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Single row routing with bounded number of doglegs per net. / Deogun, Jitender S; Roy, Arnob; Sherwani, Naveed A.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 1, 01.12.1989, p. 43-46.

Research output: Contribution to journalConference article

@article{e348e485ce39447ea53bf4e5d283f189,
title = "Single row routing with bounded number of doglegs per net",
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.",
author = "Deogun, {Jitender S} and Arnob Roy and Sherwani, {Naveed A.}",
year = "1989",
month = "12",
day = "1",
language = "English (US)",
volume = "1",
pages = "43--46",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Single row routing with bounded number of doglegs per net

AU - Deogun, Jitender S

AU - Roy, Arnob

AU - Sherwani, Naveed A.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - 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.

AB - 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.

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

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

M3 - Conference article

VL - 1

SP - 43

EP - 46

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -