Graph matching (Space Syntax)
From Design Computation
Revision as of 16:18, 12 February 2017 by Stephen Law (talk | contribs) (Created page with "Category:Space Syntax Graph matching aims to detect how similar any pair of small, labelled, directed graphs are. It achieves this by calculating how many operations are n...")
Graph matching aims to detect how similar any pair of small, labelled, directed graphs are. It achieves this by calculating how many operations are needed to fully transform one graph into another.
Cross-References
Recommended Reading
Space Syntax Glossary Conroy-Dalton R and Kirsan C. (2008). Small graph matching and building genotypes. Environment and Planning B: Planning and Design, 35 (5): 810-830.
