Artículos relacionados a Coloring Mixed Hypergraphs: Theory, Algorithms and...

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs) - Tapa dura

American Mathematical Society

 
9780821828120: Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs)
Tapa dura
ISBN 10: 0821828126 ISBN 13: 9780821828120
Editorial: American Mathematical Society, 2002

Sinopsis

The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory of colorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.The book has broad appeal. It will be of interest to both pure and applied mathematicians, particularly those in the areas of discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industries. It also makes a nice supplementary text for courses in graph theory and discrete mathematics. This is especially useful for students in combinatorics and optimization. Since the area is new, students will have the chance at this stage to obtain results that may become classic in the future.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory of colorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring. The book has broad appeal. It will be of interest to both pure and applied mathematicians, particularly those in the areas of discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industries. It also makes a nice supplementary text for courses in graph theory and discrete mathematics. This is especially useful for students in combinatorics and optimization. Since the area is new, students will have the chance at this stage to obtain results that may become classic in the future.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
American Mathematical Society
Año de publicación
2002
Idioma
Inglés
ISBN 10 
0821828126
ISBN 13 
9780821828120
Encuadernación
Tapa dura
Contacto del fabricante
no disponible
Persona responsable
Mare Nostrum Group B.V.
gpsr@mare-nostrum.co.uk

Doelen 72
Breda
4831 GR
Holanda