𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic Graph Theory.by Alan Gibbons

✍ Scribed by Review by: Glenn K. Manacher

Book ID
124939778
Publisher
Society for Industrial and Applied Mathematics
Year
1989
Tongue
English
Weight
411 KB
Volume
31
Category
Article
ISSN
0036-1445

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graph theory and algorithms
Graph theory and algorithms
✍ Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. πŸ“‚ Article πŸ“… 2012 πŸ› SciELO 🌐 English βš– 163 KB
Graph Theory with Algorithms and its App
Graph Theory with Algorithms and its Applications || Algorithms on Graphs
✍ Saha Ray, Santanu πŸ“‚ Article πŸ“… 2012 πŸ› Springer India 🌐 Hindi βš– 675 KB

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers

Algorithmic theory of random graphs
Algorithmic theory of random graphs
✍ Alan Frieze; Colin McDiarmid πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 318 KB πŸ‘ 2 views

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 . There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap