CHF 102.00

Classification Algorithms For Graphs, Digraphs, and Linear Spaces
Classification Algorithms For Graphs, Digraphs, and Linear Spaces English, German · Paperback / Softback

Shipping usually within 4 to 7 working days

Description

Read more

This book considres one the main problems in discrete mathematics which is called the classification problem. In such a problem, given a collection of properties, construct up to isomorphism all structures that satisfy them. In otherwords, the classification problem is the problem of determining complete systems of representatives of the isomorphism classes. Also, this book considers both the use of invariants and the use of partition backtracking for solving the isomorphism problems of 0,1-matrices, in general. It also discusses the inverse problem of finding all structures for a given invariant. This leads to the composition principle for incidence structures and eventually to some new results. The goal of this book is to be of great help to researchers. Also, it can be used for graduate courses in both mathematics and computer sciences.

About the author










Abdullah Al-Azemi recieved a degree in Mathematics from KuwaitUniversity in May 2000. After that he continued his studies inthe United State of America and recieved his master and Ph.D.degrees in Mathematics from Colorado State University. Currently,he is a faculty member at Kuwait University.


Product details

Authors Abdullah Al-Azemi
Publisher LAP Lambert Academic Publishing
 
Content Book
Product form Paperback / Softback
Publication date 01.01.2014
Subject Natural sciences, medicine, IT, technology > Natural sciences (general)
 
EAN 9783838302782
ISBN 978-3-8383-0278-2
Pages 216
Height (packing) 22 cm
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.