Author:
Fomin Fedor V.,Giroire Frédéric,Jean-Marie Alain,Mazauric Dorian,Nisse Nicolas
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. http://www.phdcomics.com/comics/archive.php?comicid=1456
2. Alspach, B.: Searching and sweeping graphs: a brief survey. In: Le Matematiche, pp. 5–37 (2004)
3. Fomin, F.V., Giroire, F., Jean-Marie, A., Mazauric, D., Nisse, N.: To satisfy impatient web surfers is hard. Technical Report INRIA-7740, INRIA (2011),
http://hal.inria.fr/inria-00625703/fr/
4. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Study of a Combinatorial Game in Graphs Through Linear Programming;Algorithmica;2018-08-31
2. Connected surveillance game;Theoretical Computer Science;2015-06
3. Connected Surveillance Game;Structural Information and Communication Complexity;2013
4. To Satisfy Impatient Web Surfers Is Hard;Lecture Notes in Computer Science;2012