Reference Info for R3
Text Reference:
D. R. Herber, J. T. Allison. 'Enhancements to the perfect matching-based tree algorithm for generating architectures.' Technical report, Engineering System Design Lab, UIUC-ESDL-2017-02, Urbana, IL, USA, Dec 2017.
BibTeX Source:
@techreport{Herber2017d,
author = {Herber, Daniel R and Allison, James T},
title = {Enhancements to the perfect matching-based tree algorithm for generating architectures},
type = {Technical Report},
institution = {Engineering System Design Lab},
number = {UIUC-ESDL-2017-02},
address = {Urbana, IL, USA},
month = dec,
year = {2017},
url = {http://hdl.handle.net/2142/98990},
pdf = {https://www.engr.colostate.edu/%7Edrherber/files/Herber2017d.pdf},
}
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.