• DocumentCode
    2886696
  • Title

    On planarity of W-graph

  • Author

    Zhao, Hua-An

  • Author_Institution
    Fac. of Integrated Arts & Sci., Hiroshima Univ., Japan
  • fYear
    1991
  • fDate
    16-17 Jun 1991
  • Firstpage
    698
  • Abstract
    A W-graph is a graph containing wild components and is very useful for layout design of PCB or LSI/VLSI. A wild component is a connected subgraph containing p vertices 3⩽p<∞ and p-1 edges whose locations are unspecified. This paper gives a definition of a planar W-graph and shows some sufficient conditions for testing whether a W-graph is planar or not. Finally, the difficulty for testing the planarity of a W-graph is discussed
  • Keywords
    circuit layout; graph theory; large scale integration; network topology; printed circuit design; LSI/VLSI; PCB; W-graph; connected subgraph; layout design; planarity; testing; wild component; Art; Electronic circuits; Joining processes; Large scale integration; Pins; Sufficient conditions; Testing; Transmission line matrix methods; Very large scale integration; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1991. Conference Proceedings, China., 1991 International Conference on
  • Conference_Location
    Shenzhen
  • Type

    conf

  • DOI
    10.1109/CICCAS.1991.184454
  • Filename
    184454
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2886696