暂无分享,去创建一个
[1] R. Feynmann,et al. Surely You''re Joking , 1983 .
[2] G. T. Jones. ‘Surely You're Joking, Mr Feynman!’ Adventures of a Curious Character , 1985 .
[3] W. Imrich,et al. Handbook of Product Graphs, Second Edition , 2011 .
[4] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[5] F. Hecht. “Surely you're joking, Mr. Feynman!” Adventures of a curious character , 1986 .
[6] Guy Theraulaz,et al. Do Ants Need to Estimate the Geometrical Properties of Trail Bifurcations to Find an Efficient Route? A Swarm Robotics Test Bed , 2013, PLoS Comput. Biol..
[7] Cheng Shao,et al. Cooperative optimal control: broadening the reach of bio-inspiration , 2006, Bioinspiration & biomimetics.
[8] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .
[9] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[10] I. Hargittai,et al. The mathematical intelligencer , 2008 .
[11] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[12] Anthony Bonato,et al. The Game of Cops and Robbers on Graphs , 2011 .
[13] G. Winskel. What Is Discrete Mathematics , 2007 .
[14] Volkan Isler,et al. The role of information in the cop-robber game , 2008, Theor. Comput. Sci..
[15] Alfred M. Bruckstein,et al. Why the ant trails look so straight and nice , 1993 .
[16] Nicolas Zufferey,et al. Ant Local Search and its efficient adaptation to graph colouring , 2010, J. Oper. Res. Soc..
[17] Israel A. Wagner,et al. Probabilistic Pursuits on the Grid , 1997 .
[18] V. Climenhaga. Markov chains and mixing times , 2013 .
[19] I. Bárány. LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .
[20] V. Klee,et al. Helly's theorem and its relatives , 1963 .
[21] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[22] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[23] H. Bandelt,et al. Metric graph theory and geometry: a survey , 2006 .
[24] Daniel J. Velleman. American Mathematical Monthly , 2010 .
[25] Hazel Everett,et al. Slicing an ear using prune-and-search , 1993, Pattern Recognit. Lett..
[26] Hans-Jürgen Bandelt,et al. Pseudo-modular graphs , 1986, Discret. Math..
[27] E. Krause. Taxicab Geometry: An Adventure in Non-Euclidean Geometry , 1987 .
[28] G. Dirac. On rigid circuit graphs , 1961 .