Could you please state some examples of these real-world problems where "almost symmetry" would help? Face/shape recognition comes to mind, where inexact graph matching would be useful, but are there any others? I'm not…
I would love to know whether there are some practical (non-math/cs-user facing) problems which can be solved with graph (iso,sub-iso,mono,epi,...) morphism algorithms. Sure, there's a lot you can do with it in the math…
Could you please state some examples of these real-world problems where "almost symmetry" would help? Face/shape recognition comes to mind, where inexact graph matching would be useful, but are there any others? I'm not…
I would love to know whether there are some practical (non-math/cs-user facing) problems which can be solved with graph (iso,sub-iso,mono,epi,...) morphism algorithms. Sure, there's a lot you can do with it in the math…