Printed circuit boards isomorphism: An experimental study

Aida Abiad Monge*, Alexander Grigoriev, Stefanie Niemzok

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We evaluate the discrimination power of different graph invariants in order to identify an appropriate measurement of similarity among printed circuit boards. We show that computationally expensive algorithmic evaluation of circuit boards equivalence based on the topology of the circuit boards is unnecessary in practice.Instead, the information about the circuit boards can be stored in terms of graph invariants, namely, number sequences characterizing the boards, which requires much less memory and enables quicker recognition of board equivalence. This straightforwardly leads to fast practical implementations of the search engines for the printed circuit boards. Our approach is multidisciplinary, as the tools were drawn from two fields; the industrial electronic engineering field, and the theoretic fields of graph theory and algorithms. A real case study on a search engine for printed circuit boards is conducted to illustrate the proposed approach. Finding an easily computable and complete set of graph invariants remains a challenging mathematical question.
Original languageEnglish
Article number106715
Number of pages12
JournalComputers & Industrial Engineering
Volume148
Early online date5 Aug 2020
DOIs
Publication statusE-pub ahead of print - 5 Aug 2020

JEL classifications

  • c02 - Mathematical Methods

Keywords

  • Printed circuit board;
  • Preprocessing;
  • Heuristic;
  • Graph invariant;
  • Graph isomorphism;
  • Information retrieval;
  • Search engine

Cite this