Files in this item

FilesDescriptionFormat

application/pdf

application/pdfUIUC-ESDL-2017-02 Enhancements.pdf (420kB)
Technical ReportPDF

Description

Title:Enhancements to the perfect matching-based tree algorithm for generating architectures
Author(s):Herber, Daniel Ronald; Allison, James T.
Subject(s):algorithm
architecture
graphs
perfect matchings
matlab
Abstract:In this report, a number of enhancements to the perfect matching-based tree algorithm for generating the set of unique, feasible architectures are discussed. The original algorithm was developed to generate a set of colored graphs covering the graph structure space defined by (C,R,P) and various additional network structure constraints. The proposed enhancements either more efficiently cover the same graph structure space or allow additional network structure constraints to be defined. The seven enhancements in this report are replicate ordering, avoiding loops, avoiding multi-edges, avoiding line-connectivity constraints, checking for saturated subgraphs, enumerating subcatalogs, and alternative tree traversal strategies. Some theory, implementation details, and examples are provided for each enhancement.
Issue Date:2017-12-10
Citation Info:Daniel R Herber and James T Allison. ‘Enhancements to the perfect matching-based tree algorithm for generating architectures.’ Technical Report UIUC-ESDL-2017-02, Dec. 2017.
Series/Report:UIUC-ESDL-2017-02
Genre:Technical Report
Type:Text
Language:English
URI:http://hdl.handle.net/2142/98990
Rights Information:Copyright 2015 Daniel R. Herber and James T. Allison
Date Available in IDEALS:2018-01-23


This item appears in the following Collection(s)

Item Statistics