Identification of the largest complete subgraph in design automation tasks

  • S. Yu. Luzin Avangard, Inc., Saint Petersburg, Russia
  • O. B. Polubasov Avangard, Inc., Saint Petersburg, Russia
Keywords: maximum clique, graph reduction, exhaustive search algorithm, design automation, graph theory

Abstract

The paper demonstrates the feasibility of combining exhaustive search algorithms with graph reduction methods that do not eliminate the largest complete subgraph. This approach enhances efficiency in solving design automation problems while preserving the integrity of the maximum clique within the graph structure.

Published
2003-08-31
How to Cite
Luzin, S. Y., & Polubasov, O. B. (2003). Identification of the largest complete subgraph in design automation tasks. Technology and Design in Electronic Equipment, (4), 22-25. Retrieved from https://www.tkea.com.ua/index.php/journal/article/view/TKEA2003.4.22
Issue
No. 4 (2003): Tekhnologiya i konstruirovanie v elektronnoi apparature
Section
Articles

Copyright (c) 2003 Luzin S. Yu., Polubasov O. B.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.