2016 · 12 citations · 32 references
ComputingComputer ScienceComputer ArchitectureDesign AutomationDesign OptimizationGraph AlgorithmsGraph ColoringArchitecture SearchGraph MatchingMatching AlgorithmsMatching ProblemsMatchings EnumerationNetwork ConstraintsSearch Tree EnumerationTree Search
In this article a class of architecture design problems is explored with perfect matchings. A perfect matching in a graph is a set of edges such that every vertex is present in exactly one edge. The perfect matching approach has many desirable properties such as complete design space coverage. Improving on the pure perfect matching approach, a tree search algorithm is developed that more efficiently covers the same design space. The effect of specific network structure constraints and colored graph isomorphisms on the desired design space is demonstrated. This is accomplished by determining all unique feasible graphs for a select number of architecture problems, explicitly demonstrating the specific challenges of architecture design. Additional applications of this work to the larger architecture design process is also discussed.
32
Practical graph isomorphism, II
Brendan D. McKay, Adolfo Piperno · Journal of Symbolic Computation · 2013 · 1.6K citations
Defining Network Topologies that Can Achieve Biochemical Adaptation
Wenzhe Ma, Ala Trusina, Hana El‐Samad et al. · Cell · 2009 · 982 citations · Full text
Life Sciences, Biochemistry, Biological Systems Modeling +15
A Study of Design Fixation, Its Mitigation and Perception in Engineering Design Faculty
Julie Linsey, I-Hsiang Tseng, Katherine Fu et al. · Journal of Mechanical Design · 2010 · 388 citations
Arts, Design, Design Thinking +11