東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Random graphs

Bollobas, Bela.

FindBook

Google Book

Amazon

博客來

Random graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Random graphs/ Bela Bollobas.
作者:	Bollobas, Bela.
出版者:	Cambridge :Cambridge University Press, : 2001.,
面頁冊數:	xviii, 498 p. :ill., digital ;24 cm.
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Random graphs. -
電子資源:	https://doi.org/10.1017/CBO9780511814068
ISBN:	9780511814068

Random graphs
Bollobas, Bela.

Random graphs[electronic resource] /Bela Bollobas. - Second edition. - Cambridge :Cambridge University Press,2001. - xviii, 498 p. :ill., digital ;24 cm. - Cambridge studies in advanced mathematics ;73. - Cambridge studies in advanced mathematics ;73..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdos and Renyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.

ISBN: 9780511814068Subjects--Topical Terms:

731238
Random graphs.

LC Class. No.: QA166.17 / .B66 2001

Dewey Class. No.: 511.5

Random graphs
LDR:01815nmm a2200289 a 4500 001 2227150
003 UkCbUP
005 20151005020623.0
006 m d
007 cr nn 008maaau
008 210414s2001 enk o 1 0 eng d
020 $a 9780511814068 $q (electronic bk.)
020 $a 9780521809207 $q (hardback)
020 $a 9780521797221 $q (paperback)
035 $a CR9780511814068
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA166.17 $b .B66 2001
082 0 4 $a 511.5 $2 21
090 $a QA166.17 $b .B692 2001
100 1 $a Bollobas, Bela. $3 532044
245 1 0 $a Random graphs $h [electronic resource] / $c Bela Bollobas.
250 $a Second edition.
260 $a Cambridge : $b Cambridge University Press, $c 2001.
300 $a xviii, 498 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge studies in advanced mathematics ; $v 73
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdos and Renyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.
650 0 $a Random graphs. $3 731238
830 0 $a Cambridge studies in advanced mathematics ; $v 73. $3 3470412
856 4 0 $u https://doi.org/10.1017/CBO9780511814068