Выделение в графе наибольшего полного подграфа в задачах автоматизации проектирования
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 g...
Saved in:
| Date: | 2003 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PE "Politekhperiodika", Book and Journal Publishers
2003
|
| Subjects: | |
| Online Access: | https://www.tkea.com.ua/index.php/journal/article/view/TKEA2003.4.22 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Technology and design in electronic equipment |