José L. Balcázar. The Complexity of Searching Succinctly Represented Graphs. In Zoltán Fülöp, Ferenc Gécseg, editors, Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings. Volume 944 of Lecture Notes in Computer Science, pages 208-219, Springer, 1995.
Abstract is missing.