Voloshin, who is not identified, writes for researchers and graduate students in discrete mathematics, operations research, and computer science. Mixed hypergraphs, he explains, contain classic edges, which have at least two vertices of distinct colors; and anti-edges, which have at least two vertices of the same color. He finds that trying to establish a formal symmetry between the two types of constraints reveals a deep asymmetry between the problems of the minimum and maximum number of colors that pervades a number of fields. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Zustand: New. First edition, first printing, 181 pp., Hardcover, new. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Artikel-Nr. ZB1346630
Anzahl: 1 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. FW-9780821828120
Anzahl: 2 verfügbar
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Hardback. Zustand: New. 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. Artikel-Nr. LU-9780821828120
Anzahl: 1 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 6021575-n
Anzahl: 7 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. illustrated edition. 181 pages. 10.00x7.00x0.75 inches. In Stock. Artikel-Nr. __0821828126
Anzahl: 2 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states 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. Series: Fields Institute Monographs. Num Pages: 181 pages, figures, bibliography, index. BIC Classification: PBV; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 190 x 261 x 15. Weight in Grams: 564. . 2002. Hardcover. . . . . Artikel-Nr. V9780821828120
Anzahl: 1 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 6021575
Anzahl: 7 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states 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. Series: Fields Institute Monographs. Num Pages: 181 pages, figures, bibliography, index. BIC Classification: PBV; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 190 x 261 x 15. Weight in Grams: 564. . 2002. Hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780821828120
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9780821828120_new
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states 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 applica. Artikel-Nr. 595067921
Anzahl: 2 verfügbar