Abstract:
In this paper we will present an algorithm that is capable of recognizing symmetry in an electronic network graph in better than O((n+b)/sup 2/) time for typical circuits...Show MoreMetadata
Abstract:
In this paper we will present an algorithm that is capable of recognizing symmetry in an electronic network graph in better than O((n+b)/sup 2/) time for typical circuits. Applications in symbolic analysis and behavioural modeling are presented.<>
Date of Conference: 30 May 1994 - 02 June 1994
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-1915-X
