现代图论
Modern graph theory
Béla Bollobás · 初版 1998 年
3人推荐
4位读者提及
4次提及
本书是对 graph theory 的深入阐述；它反映了该学科的现状，并强调了与其他纯数学分支的交融。本书脱胎于作者先前的著作 Graph Theory - An Introductory Course，但篇幅是前作的两倍有余，从而得以展现该学科的诸多最新进展。考虑到 graph theory 只是争夺学生精力的众多课程之一，书中包含了大量生动的描述性段落，旨在展现该学科的精髓并激发读者的兴趣。
Hacker News 上怎么说
正在加载完整评论……
……Ullman。（感谢 @reacweb 提醒。）* 莱因哈德·迪斯特尔（Reinhard Diestel）的《图论》（Graph Theory）。* 如果你想更深入学习，并且喜欢那种一个字都不舍得跳过的书，我强烈推荐贝拉·博洛巴什（Béla Bollobás）的《现代图论》（Modern Graph Theory）：这是我最喜欢的教材之一！* 史蒂文·斯基恩纳（Steven Skiena）的《算法设计手册》（The Algorithm Design Manual）。* 尽管很多人似乎要么推崇 Cormen 等人的那本（CLRS），要么推崇 Sedgewick……
…Ullman. (Thanks, @reacweb, for the reminder.) * “Graph Theory”, by Reinhard Diestel. * If you feel you want to go deeper, and like a book which you cannot skip a single word, I strongly recommend “Modern Graph Theory”, by Béla Bollobás: it is one of my favorite textbooks ever! * “The Algorithm Design Manual”, by Steven Skiena. * While a lot of people seems to praise either the Cormen et al. or the Sedgewick…
……一些：对于经典枚举组合学，有理查德·斯坦利（Richard Stanley）的《枚举组合学》（Enumerative Combinatorics）。对于图论，迪斯特尔（Diestel）的《图论》在入门课程里很受欢迎，而博洛巴什（Bollobas）的《现代图论》更进阶，而且（正如书名所说）更现代。还有拉兹洛·洛瓦斯（Laszlo Lovasz）超棒的《组合学问题与习题集》（Combinatorial Problems and Exercises），那是一本习题与解答合集，非常适合用来……
…some: For classical enumerative combinatorics, there is Richard Stanley's 'Enumerative Combinatorics'. For graph theory, Diestel's book 'Graph Theory' is popular for introductory courses, and Bollobas' 'Modern Graph Theory' is more advanced and (as the title says) modern. And there is Laszlo Lovasz's fantastic 'Combinatorial Problems and Exercises', which is a collection of problems and answers, and is a great way to get…
……根本不是我的菜，而且还有更多抽象或形式化的书，比如 Rudin 的书。如果你想接触一些不需要太多厚重工具准备的领域，博洛巴什的图论书很棒（但很难）。比如他的《现代图论》[4]。对于线性代数，我最喜欢的书之一（不过是在我已经学完这门课之后看的）是特雷费森（Trefethen）的《数值线性代数》（Numerical Linear Algebra）[5]。另一个优美的领域则处于交叉口……
…cup of tea at all and there are more abstract or formal books like Rudin's. If you want to approach fields without a lot of machinery, graph theory books by Bollobas are great (but difficult). See his Modern Graph Theory book [4] as an example. For linear algebra, one of my favorites (but it was after I already learned the subject) is Trefethen's Numerical Linear Algebra book [5]. Another beautiful topic is at the intersection…
……我找到的一些优秀的 CS 书籍：《近似算法》（Approximation Algorithms）http://link.springer.com/book/10.1007/978-3-662-04565-7 《怎样解题：现代启发式方法》（How to Solve It: Modern Heuristics）http://link.springer.com/book/10.1007/978-3-662-07807-5 《现代图论》（Modern Graph Theory）http://link.springer.com/book/10.1007/978-1-4612-0619-4 《计算几何》（Computational Geometry）http://link.springer.com/book/10.1007/978-3-662-03427-9
…good CS books that I found: Approximation Algorithms http://link.springer.com/book/10.1007/978-3-662-04565-7 How to Solve It: Modern Heuristics http://link.springer.com/book/10.1007/978-3-662-07807-5 Modern Graph Theory http://link.springer.com/book/10.1007/978-1-4612-0619-4 Computational Geometry http://link.springer.com/book/10.1007/978-3-662-03427-9