The Decomposition Tree of a Biconnected Graph

2014 ◽  
Vol 204 (2) ◽  
pp. 232-243 ◽  
Author(s):  
D. V. Karpov
Keyword(s):  
Decomposition Tree ◽  
Biconnected Graph

Behavior-Form Double Directions Creative Conceptual Design Model and Its Quotient Space Implementation

2008 ◽  
Author(s):  
Yu-Xin Wang ◽  
Yu-Tong Li ◽  
Jian-Wei Wang
Keyword(s):  
Conceptual Design ◽  
Design Process ◽  
Quotient Space ◽  
Basic Structure ◽  
Basic Operation ◽  
Decomposition Tree ◽  
Function Decomposition ◽  
Design Variables ◽  
Set Up

This paper presents a novel indirect matching approach between the function layer and the form layer to enhance the capability for the FBS method to obtain the creative conceptual design results. Firstly, the basic operation actions set, which is composed of the basic operation actions obtained by decomposing each function in the lowest level of the function decomposition tree in the FBS model into the sub-functions, in the function layer is regrouped dynamically. This behavior regroup process has introduced the new design variables into the conceptual design process and leads the behavior creativity to produce. On the other hand, considering the multi-functions for each basic structure to have and representing these functions with the basic operation actions, then the basic operation actions set in the form layer is set up. Dynamic regrouping this set in the form layer, the new design variables has been introduced into the conceptual design process, and leads the form creativity to produce. Through the above behavior-form double directions creative process, the solution scope of the conceptual design is enlarged obviously. Therefore, the method present in this paper has enough capability to obtain the creative conceptual results. Furthermore, the model presented in this paper is represented with the quotient space mathematically. The case study has shown that in the function layer, through adjusting the attribute function, which determines the partition grain of the basic operation actions set in the function layer or in the form layer, the new behaviors can be generated.

scholarly journals Recursive decomposition tree of a Moore co-family and closure algorithm

2013 ◽  
Vol 70 (1-2) ◽  
pp. 107-122
Author(s):  
Pierre Colomb ◽  
Alexis Irlande ◽  
Olivier Raynaud ◽  
Yoan Renaud
Keyword(s):  
Decomposition Tree ◽  
Recursive Decomposition ◽  
Closure Algorithm

Centering a spanning tree of a biconnected graph

1989 ◽  
Vol 32 (5) ◽  
pp. 247-250 ◽  
Author(s):  
Grant A. Cheston ◽  
Art Farley ◽  
S.T. Hedetniemi ◽  
Andrzej Proskurowski
Keyword(s):  
Spanning Tree ◽  
Biconnected Graph

scholarly journals Multi-level basis selection of wavelet packet decomposition tree for heart sound classification

2013 ◽  
Vol 43 (10) ◽  
pp. 1407-1414 ◽  
Author(s):  
Fatemeh Safara ◽  
Shyamala Doraisamy ◽  
Azreen Azman ◽  
Azrul Jantan ◽  
Asri Ranga Abdullah Ramaiah
Keyword(s):  
Heart Sound ◽  
Wavelet Packet ◽  
Wavelet Packet Decomposition ◽  
Decomposition Tree ◽  
Sound Classification ◽  
Multi Level ◽  
Selection Of

scholarly journals Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems

2001 ◽  
Vol 5 (4) ◽  
pp. 1-27 ◽  
Author(s):  
Reuven Bar-Yehuda ◽  
Guy Even ◽  
Jon Feldman ◽  
Joseph(Seffi) Naor
Keyword(s):  
Decomposition Tree ◽  
Linear Arrangement ◽  
Optimal Orientation ◽  
Balanced Decomposition
Sign in / Sign up

Export Citation Format

Share Document