
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24October 26
ISBN: 081860591X
ASCII Text  x  
B. Mishra, "An Efficient Algrithm To Find All 'Bidirectional' Edges Of An Undirected Graph," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 207216, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984.  
BibTex  x  
@article{ 10.1109/SFCS.1984.715917, author = {B. Mishra}, title = {An Efficient Algrithm To Find All 'Bidirectional' Edges Of An Undirected Graph}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1984}, isbn = {081860591X}, pages = {207216}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715917}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  An Efficient Algrithm To Find All 'Bidirectional' Edges Of An Undirected Graph SN  081860591X SP207 EP216 A1  B. Mishra, PY  1984 VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
An efficient algorithm for the AllBidirectionalEdges Problem is presented. The AllBidirectionalEdges Problem is to find an edgelabelling of an undirected network, G = (V,E), with a source and a sink, such that an edge [u,v] /spl epsi/ E is labelled (u,v) or (v,u) (or both) depending on the existence of a (simple) path from the source to sink that visits the vertices u and v, in the order u,v or v,u, respectively. The algorithm presented works by partitioning the graph into a set of bridges and analyzing them recursively. The time complexity of the algorithm is shown to be O(\E\ . \V\). The problem arises naturally in the context of the simulation of in 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.
Citation:
B. Mishra, "An Efficient Algrithm To Find All 'Bidirectional' Edges Of An Undirected Graph," focs, pp.207216, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.