Jayalal Sarma
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1
Frequent co-authors
Research Timeline
2026
On the Reachability Problem on Monoid-Labelled Undirected Graphs
The paper studies the labelled reachability problem for undirected graphs with edges labelled by elements of a monoid M, and provides finer complexity bounds and dichotomies based on the monoid and the accepting set.
Highlighted terms show continued research focus across papers