Abstract
A wild component is a connected subgraph having at least three vertices and containing the minimum number of edges whose locations are unspecified. In a VLSI or on a printed board, there are points which can be connected in any wiring pattern as long as they are connected together. These points can be represented by a wild component, and it is shown that the properties of cutsets and loops (circuits) with wild components are almost the same as those without wild components. Furthermore, a process of obtaining a planar graph from another planar graph containing wild components is very similar to one when there are no wild components. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
