Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
