Informations supplémentaires issues du web sur ce livre

Les informations affichées ci-dessous sont récupérées par une recherche par titre sur google Books API

Titre : Algorithmic Graph Theory and Perfect Graphs

Auteurs : Martin Charles Golumbic

Description : Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.

Nombre de pages : 306

Catégorie : Mathematics

Type : BOOK

Langue : en

Editeur : Elsevier

Date de publication : 2014-05-10

ISBN 10 : 9781483271972

ISBN 13 : 1483271978

Afficher le livre dans Google

Copyright © 2014 - ENSA Al-Hoceima | Tous droits réservés

Site crée par Tarik BOUDAA