Almost-Symmetry in Search

A.F. Donaldson, P. Gregory

Research output: Book/ReportOther report

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.
LanguageEnglish
Publication statusPublished - 2005

Fingerprint

Computational efficiency
Color

Keywords

  • searching
  • search algorithm
  • information retrieval

Cite this

Donaldson, A. F., & Gregory, P. (2005). Almost-Symmetry in Search.
Donaldson, A.F. ; Gregory, P. / Almost-Symmetry in Search. 2005.
@book{4090d106bbe24fe6a376d5ca20d14346,
title = "Almost-Symmetry in Search",
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.",
keywords = "searching, search algorithm, information retrieval",
author = "A.F. Donaldson and P. Gregory",
year = "2005",
language = "English",

}

Donaldson, AF & Gregory, P 2005, Almost-Symmetry in Search.

Almost-Symmetry in Search. / Donaldson, A.F.; Gregory, P.

2005.

Research output: Book/ReportOther report

TY - BOOK

T1 - Almost-Symmetry in Search

AU - Donaldson, A.F.

AU - Gregory, P.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - searching

KW - search algorithm

KW - information retrieval

UR - http://www.dcs.gla.ac.uk/publications/

M3 - Other report

BT - Almost-Symmetry in Search

ER -

Donaldson AF, Gregory P. Almost-Symmetry in Search. 2005.