ITEM METADATA RECORD
Title: Optimized algorithm to find all symmetry-distinct maps of a graph: application to topology-driven molecular design
Authors: Lijnen, Erwin ×
Ceulemans, Arnout #
Issue Date: Feb-2009
Publisher: Springer
Series Title: Journal of Mathematical Chemistry vol:45 issue:2 pages:386-405
Conference: 20 years of Molecular Topology in Cluj location:Cluj-Napoca date:25-30 September, 2006
Abstract: We describe an optimized algorithm for finding all symmetry-distinct maps of a given graph. It contains significant improvements on the computing time by representing the maps as linear codes. In this way, the time consuming step of removing equivalent maps can be solved more efficiently by searching for a "minimal code". As an example we apply the algorithm to the 32-vertex Dyck-graph for which more than 4 billion cases should be investigated. One of its most symmetrical maps forms an interesting blueprint for a hypothetical negatively curved carbon allotrope of genus 3.
ISSN: 0259-9791
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Quantum Chemistry and Physical Chemistry Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy

 




All items in Lirias are protected by copyright, with all rights reserved.

© Web of science