Algorithms in graph theory and their use for solving problems in architectural design (Q1109794)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms in graph theory and their use for solving problems in architectural design |
scientific article; zbMATH DE number 4070963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms in graph theory and their use for solving problems in architectural design |
scientific article; zbMATH DE number 4070963 |
Statements
Algorithms in graph theory and their use for solving problems in architectural design (English)
0 references
1988
0 references
The authors' work on developing models based on graph theory to solve problems in architectural design is summarized. The models presented are aimed at helping designers in the initial stages of design. Plans are represented by graphs and the Max-flow Min-cut algorithm is described for decomposing complex graphs. The PERT technique is used to transform graphs into plans.
0 references
computer-aided design
0 references
architectural design
0 references
complex graphs
0 references
0.9023858
0 references
0.8531898
0 references
0 references
