| Autor: |
Balakrishnarajan, M M1 (AUTHOR), Venuvanalingam, P (AUTHOR) |
| Předmět: |
|
| Zdroj: |
Journal of Chemical Information & Computer Sciences. Sep-Oct1994, Vol. 34 Issue 5, p1113-1117. 5p. |
| Abstrakt: |
The generalized Wheland polynomial of a graph is computed as perfect matchings of the associated edge-weighted complete graph. A depth-first-search algorithm with unit penetrance is developed for an effective combinatorial exploration of all perfect matchings of the edge-weighted complete graph, using a prior control knowledge. Since this a typical NP-class problem, dynamic learning techniques are designed to push the tractable limit of the problem further. The choice of the learning technique depends solely on the amount of memory available for use since demand for memory increases concomitantly with knowledge acquisition. The skeleton of the algorithm is presented in a Pascal-like pseudo language. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Library, Information Science & Technology Abstracts |
| Externí odkaz: |
|
