Hypergraph Theory - An Introduction (Paperback, 2013 ed.)

This book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their diversity in order to perceive their value and power as mathematical tools. This book will be a great asset to upper-level undergraduate and graduate students in computer science and mathematics. It has been the subject of an annual Master's course for many years, making it also ideally suited to Master's students in computer science, mathematics, bioinformatics, engineering, chemistry, and many other fields. It will also benefit scientists, engineers and anyone else who wants to understand hypergraphs theory.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Mathematical Engineering
Release date:	June 2015
First published:	2013
Authors:	Alain Bretto
Dimensions:	235 x 155 x 15mm (L x W x T)
Format:	Paperback
Pages:	119
Edition:	2013 ed.
ISBN-13:	978-3-319-03370-9
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General Promotions
LSN:	3-319-03370-0
Barcode:	9783319033709

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!