Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use more efficient search-based approach for auto-completion #48

Open
szschaler opened this issue Jun 10, 2020 · 0 comments
Open

Use more efficient search-based approach for auto-completion #48

szschaler opened this issue Jun 10, 2020 · 0 comments
Projects

Comments

@szschaler
Copy link
Member

Currently, auto-completion is effectively a brute-force search, which can become quite expensive. Should explore whether search-based approaches such as https://www.sciencedirect.com/science/article/pii/S0164121214001484 or work from sub-graph matching (e.g., https://github.com/ciaranm/glasgow-subgraph-solver) can help improve this.

@szschaler szschaler created this issue from a note in GTS Morpher (Backlog) Jun 10, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
GTS Morpher
  
Backlog
Development

No branches or pull requests

1 participant