2 citations · 2 across the 1 of their papers we have counts for
1 paper
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols…