Almost-Symmetry in Search

Donaldson, A.F. and Gregory, P. (2005) Almost-Symmetry in Search. University of Glasgow.

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.

• Share and Export
  

  RefWorksRIS (EndNote Online, Zotero, Ref manager, etc)RDF+XMLEndNoteASCII CitationOpenURL ContextObject in SpanMPEG-21 DIDLRIOXX2 XMLBibTeXAtomEP3 XMLDublin CoreRDF+N-TriplesMODSHTML CitationJSONData Cite XMLRDF+N3Multiline CSVOpenURL ContextObjectReferSimple MetadataMETS
• Item metadata

  Item type:	Report
  ID code:	2728
  Dates:	Date Event 2005 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Strathprints Administrator
  Date deposited:	28 Mar 2007
  Last modified:	11 Nov 2024 15:37
  Related URLs:	http://www.dcs.gla.ac.uk/publications/
  URI:	https://strathprints.strath.ac.uk/id/eprint/2728