Efficient algorithm to find all 'bidirectional' edges of an undirected graph

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An efficient algorithm is presented for the all-bidirectional-edges problem, which is to find an edge-labeling of an undirected network, G equals (V,E), with a source and a sink, such that an edge left bracket u,v right bracket belonging to E is labeled (u,v) or (v,u) (or both), depending on the existence of a (simple) path from the source to the sink that visits the vertices u and v in the order u,v or v,u, respectively. The algorithm works by partitioning the graph into a set of bridges and analyzing them recursively. The time complexity of the algorithm is determined. The problem arises in the simulation of an MOS transistor network in which a transistor may operate as a unilateral or a bilateral device, depending on the voltages at its source and drain nodes. For efficient simulation, it is required to detect the set of transistors that may operate as bilateral devices. Also, this algorithm can be used in order to detect all the sneak paths in a network of pass transistor.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages207-216
Number of pages10
ISBN (Print)081860591X
StatePublished - 1984

Fingerprint

Transistors
MOSFET devices
Labeling
Electric potential

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Mishra, B. (1984). Efficient algorithm to find all 'bidirectional' edges of an undirected graph. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 207-216). IEEE.

Efficient algorithm to find all 'bidirectional' edges of an undirected graph. / Mishra, Bhubaneswar.

Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1984. p. 207-216.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mishra, B 1984, Efficient algorithm to find all 'bidirectional' edges of an undirected graph. in Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, pp. 207-216.
Mishra B. Efficient algorithm to find all 'bidirectional' edges of an undirected graph. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1984. p. 207-216
Mishra, Bhubaneswar. / Efficient algorithm to find all 'bidirectional' edges of an undirected graph. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1984. pp. 207-216
@inproceedings{64f567cb52a8489ba73274bb8b1dc2a6,
title = "Efficient algorithm to find all 'bidirectional' edges of an undirected graph",
abstract = "An efficient algorithm is presented for the all-bidirectional-edges problem, which is to find an edge-labeling of an undirected network, G equals (V,E), with a source and a sink, such that an edge left bracket u,v right bracket belonging to E is labeled (u,v) or (v,u) (or both), depending on the existence of a (simple) path from the source to the sink that visits the vertices u and v in the order u,v or v,u, respectively. The algorithm works by partitioning the graph into a set of bridges and analyzing them recursively. The time complexity of the algorithm is determined. The problem arises in the simulation of an MOS transistor network in which a transistor may operate as a unilateral or a bilateral device, depending on the voltages at its source and drain nodes. For efficient simulation, it is required to detect the set of transistors that may operate as bilateral devices. Also, this algorithm can be used in order to detect all the sneak paths in a network of pass transistor.",
author = "Bhubaneswar Mishra",
year = "1984",
language = "English (US)",
isbn = "081860591X",
pages = "207--216",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",

}

TY - GEN

T1 - Efficient algorithm to find all 'bidirectional' edges of an undirected graph

AU - Mishra, Bhubaneswar

PY - 1984

Y1 - 1984

N2 - An efficient algorithm is presented for the all-bidirectional-edges problem, which is to find an edge-labeling of an undirected network, G equals (V,E), with a source and a sink, such that an edge left bracket u,v right bracket belonging to E is labeled (u,v) or (v,u) (or both), depending on the existence of a (simple) path from the source to the sink that visits the vertices u and v in the order u,v or v,u, respectively. The algorithm works by partitioning the graph into a set of bridges and analyzing them recursively. The time complexity of the algorithm is determined. The problem arises in the simulation of an MOS transistor network in which a transistor may operate as a unilateral or a bilateral device, depending on the voltages at its source and drain nodes. For efficient simulation, it is required to detect the set of transistors that may operate as bilateral devices. Also, this algorithm can be used in order to detect all the sneak paths in a network of pass transistor.

AB - An efficient algorithm is presented for the all-bidirectional-edges problem, which is to find an edge-labeling of an undirected network, G equals (V,E), with a source and a sink, such that an edge left bracket u,v right bracket belonging to E is labeled (u,v) or (v,u) (or both), depending on the existence of a (simple) path from the source to the sink that visits the vertices u and v in the order u,v or v,u, respectively. The algorithm works by partitioning the graph into a set of bridges and analyzing them recursively. The time complexity of the algorithm is determined. The problem arises in the simulation of an MOS transistor network in which a transistor may operate as a unilateral or a bilateral device, depending on the voltages at its source and drain nodes. For efficient simulation, it is required to detect the set of transistors that may operate as bilateral devices. Also, this algorithm can be used in order to detect all the sneak paths in a network of pass transistor.

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

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

M3 - Conference contribution

SN - 081860591X

SP - 207

EP - 216

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -