Recent content by seel

  1. seel

    Combining Graphs: Finding Solutions through Graph Homorphisms

    @pbuk great! Many thanks. Will work on it and post back here. Thanks!
  2. seel

    Combining Graphs: Finding Solutions through Graph Homorphisms

    we are breaking down usual programatic organisations in house design (living room, bedrooms, kitchen etc.) into activities (eating, slepping, socialising, cooking, storing, playing music etc.). Each of this activity has a number of attributes (silent, private, loud etc.) linked to it with...
  3. seel

    Combining Graphs: Finding Solutions through Graph Homorphisms

    Hi @Mark44, many thanks for your comments. The activities/attributes in the graphs I posted are just an example. I am more interested in finding a good way to merge two or more graphs into one. If you have any idea, it would be helpful! thanks!
  4. seel

    Combining Graphs: Finding Solutions through Graph Homorphisms

    We are working on an architectural project using graphs and we are looking for a way to combine separate graphs into one. We looked into methods to generate graph homorphisms, following the maximum graph homomorphism (MGH) (Langberg et al. 2006) and Paweł Rzążewski’s Exact Algorithm (2014)...
Back
Top