Enhancements to the perfect matching-based tree algorithm for generating architectures

Herber, Daniel Ronald; Allison, James T.

Permalink

https://hdl.handle.net/2142/98990 Copy

Description

Title

Enhancements to the perfect matching-based tree algorithm for generating architectures

Author(s)

• Herber, Daniel Ronald
• Allison, James T.

Issue Date

2017-12-10

Keyword(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.

Series/Report Name or Number

UIUC-ESDL-2017-02

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/98990

Copyright and License Information

Copyright 2015 Daniel R. Herber and James T. Allison

Owning Collections