Probability on Trees and Networks
by Russell Lyons, Yuval Peres
Publisher: Cambridge University Press 2016
Number of pages: 716
This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.
Home page url
Download or read it online for free here:
by Ton Kloks, Yue-Li Wang - viXra.org
This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs. For this last topic we found it necessary to include a chapter on graph classes.
by Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
by Roberto Tamassia (ed.) - CRC Press
The Handbook provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering.
by Beril Sirmacek (ed.) - InTech
Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your scientific field. The very basics are not explained at the beginner level.