Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Almost-Symmetry in Search

Donaldson, A.F. and Gregory, P. (2005) Almost-Symmetry in Search. [Report]

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

Identifying and using a greater variety of symmetries often improves computational efficiency. Hence, it is natural to relax the notion of symmetry and deal with almost-symmetries which retain useful properties, occur more often and may have greater impact. In this work we consider a class of almost-symmetries, their representation, discovery and usage. Our approach is to relax the notion of graph symmetries (automorphisms) to account for vertices whose colors may change and whose edges may appear or disappear. In particular, our algorithms can discover a small number edge additions or removals that can make a given graph more symmetric.

Item type: Report
ID code: 2728
Keywords: searching, search algorithm, information retrieval, Electronic computers. Computer science
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
Depositing user: Strathprints Administrator
Date Deposited: 28 Mar 2007
Last modified: 17 Jul 2013 14:24
URI: http://strathprints.strath.ac.uk/id/eprint/2728

Actions (login required)

View Item