On the Complexity of String Matching for Graphs

Overview of attention for article published in ACM Transactions on Algorithms, April 2023

Altmetric Badge

About this Attention Score

Among the highest-scoring outputs from this source (#21 of 154)
Good Attention Score compared to outputs of the same age (70th percentile)

Mentioned by

twitter: 6 X users

Citations

dimensions_citation: 9 Dimensions

Readers on

mendeley: 11 Mendeley

Summary X Dimensions citations

So far, Altmetric has seen 6 X posts from 6 X users, with an upper bound of 5,662 followers.

@DrawsMiguel @burntsushi5 @junyer I have thought about the idea of NFA techniques to match subgraphs and seemed reasonable. Do you mean what would be described as "string matching in labeled graphs"? e.g. in this paper (not automata-based, just talking abo

14 Mar 2024

Reply Repost Favourite

RT @veli_makinen: Three years it took, but finally out: https://t.co/vBOILheVrI

20 Mar 2023

Reply Repost Favourite

RT @veli_makinen: Three years it took, but finally out: https://t.co/vBOILheVrI

18 Mar 2023

Reply Repost Favourite

RT @veli_makinen: Three years it took, but finally out: https://t.co/vBOILheVrI

18 Mar 2023

Reply Repost Favourite

This page shows the most recent X posts that mention this research output.

Click here to find out how to access more activity, including 2 additional X posts.