Author:
Berwanger Dietmar,Dawar Anuj,Hunter Paul,Kreutzer Stephan
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. J. Barát, Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics (to appear)
2. Lecture Notes in Artificial Intelligence;D. Berwanger,2005
3. Lecture Notes in Computer Science;H.L. Bodlaender,1997
4. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwan, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Sematics (B), vol. B, pp. 193–242 (1990)
5. Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. TCS 172, 233–254 (1997)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献