---
title: "On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them"
authors:
  - "G. M. Adelson-Velskiy"
  - "Vladimir L. Arlazarov"
  - "M. V. Donskoy"
doi: ""
url: "https://ijcai.org/proceedings/1975/46"
pdf: "https://ijcai.org/proceedings/1975/0046.pdf"
venue: "Proceedings of the Fourth International Joint Conference on Artificial Intelligence"
year: 1975
pages: "304-307"
track: "Search Techniques"
keywords:
---

# On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy

*Proceedings of the Fourth International Joint Conference on Artificial Intelligence*, pages 304-307.

## Abstract

The paper discusses necessity of structuring a search tree. A theorem is stated that the cl.-~ procedure is the only search reduction procedure for non-structured minimay problems. For a class of problems structure in some way a non-trivial search reduction method is described.