Difference between revisions of "Graph matching (Space Syntax)"
From Design Computation
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...") |
Abel Maciel (talk | contribs) (→Recommended Reading) |
||
| Line 7: | Line 7: | ||
=Recommended Reading= | =Recommended Reading= | ||
[http://otp.spacesyntax.net/glossary/ Space Syntax Glossary] | [http://otp.spacesyntax.net/glossary/ 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. | Conroy-Dalton R and Kirsan C. (2008). Small graph matching and building genotypes. Environment and Planning B: Planning and Design, 35 (5): 810-830. | ||
Latest revision as of 21:03, 17 January 2020
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
Conroy-Dalton R and Kirsan C. (2008). Small graph matching and building genotypes. Environment and Planning B: Planning and Design, 35 (5): 810-830.
