𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems

✍ Scribed by M.M. Balakrishnarajan; P. Venuvanalingam

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
541 KB
Volume
37
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

The sextet polynomial that counts different ways of selecting varying number of resonating sextets on the hexagonal system is computed using a search based symbol manipulation algorithm. This is a #P Complete combinatorial enumeration problem, and artificial intelligence (AI) is employed for efficient enumeration. This is done by selective exploration of the semantic tree defined for that purpose. Hexagons of the graph are defined as symbols and each node of the tree is defined as a set of mutually disjoint hexagon patterns of the graph. The sextet polynomial is generated by enumerating a suitable subset of the nodes of the tree. A pruning heuristic that avoids redundant branches by a priori learning at selected intelligent branches of the semantic tree is designed. (~

πŸ“œ SIMILAR VOLUMES

A Tree Projection Algorithm for Generati
A Tree Projection Algorithm for Generation of Frequent Item Sets
✍ Ramesh C. Agarwal; Charu C. Aggarwal; V.V.V. Prasad πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 355 KB

In this paper we propose algorithms for generation of frequent item sets by successive construction of the nodes of a lexicographic tree of item sets. We discuss different strategies in generation and traversal of the lexicographic tree such as breadth-first search, depth-first search, or a combinat

A generalized algorithm for the recursiv
A generalized algorithm for the recursive implementation of polynomial filters
✍ P. Agathoklis; H. Xu πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 644 KB

Polynomial jilters have many applications in real time control, estimation and identification, particularly when information about the system dynamics and noise statistics are not precisely known. In this paper, a generalized recursive algorithm for nth order polynomial jilters is developed. The par

A polynomial algorithm for finding T-spa
A polynomial algorithm for finding T-span of generalized cacti
✍ Krzysztof Giaro; Robert Janczewski; MichaΕ‚ MaΕ‚afiejski πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 166 KB

It has been known for years that the problem of computing the T -span is NP-hard in general. Recently, Giaro et al. (Discrete Appl. Math., to appear) showed that the problem remains NP-hard even for graphs of degree 6 3 and it is polynomially solvable for graphs with degree 6 2. Herein, we extend th