Following the guidelines proposed by R.Balducci and R.Pearlman for an efficient exact solution of the Ring Perception Problem, a new approach based on 'pre-filtering' technique is introduced to perceive rings in structures represented by simple graphs in which each node has degree d>=2. The resulting algorithm has proved to reduce both resources allocation and redundant information processing when dealing with chemical cases. Actual computing times have constsntly shown a conspicious reduction with respect to methods using hash-tables to treat redundant informations. Farthermore no user intervention to 'tune' effectivenes is required (e.g. hash-table dimensioning)
A Redundance Aware Algorithm for the Ring Perception Problem
MANCINI, Giorgio
1997-01-01
Abstract
Following the guidelines proposed by R.Balducci and R.Pearlman for an efficient exact solution of the Ring Perception Problem, a new approach based on 'pre-filtering' technique is introduced to perceive rings in structures represented by simple graphs in which each node has degree d>=2. The resulting algorithm has proved to reduce both resources allocation and redundant information processing when dealing with chemical cases. Actual computing times have constsntly shown a conspicious reduction with respect to methods using hash-tables to treat redundant informations. Farthermore no user intervention to 'tune' effectivenes is required (e.g. hash-table dimensioning)I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
