This book is for math and computer science majors, for students and representatives of many other disciplines (like bioinformatics, for example) taking courses in graph theory, discrete mathematics, data structures, algorithms. It is also for anyone who wants to understand the basics of graph theory, or just is curious. No previous knowledge in graph theory or any other significant mathematics is required. The very basic facts from set theory, proof techniques and algorithms are sufficient to understand it; but even those are explained in the text. Structurally, the text is divided into two parts where Part II is the generalisation of Part I. The first part discusses the key concepts of graph theory with emphasis on trees, bipartite graphs, cycles, chordal graphs, planar graphs and graph colouring. The second part considers generalisations of Part I and discusses hypertrees, bipartite hypergraphs, hypercycles, chordal hypergraphs, planar hypergraphs and hypergraph colouring. There is an interaction between the parts and within the parts to show how ideas of generalisations work. The main point is to exhibit the ways of generalisations and interactions of mathematical concepts from the very simple to the most advanced. One of the features of this text is the duality of hypergraphs. This fundamental concept is missing in graph theory (and in its introductory teaching) because dual graphs are not properly graphs, they are hypergraphs. However, as Part II shows, the duality is a very powerful tool in understanding, simplifying and unifying many combinatorial relations; it is basically a look at the same structure from the opposite (vertices versus edges) point of view.
"Sinopsis" puede pertenecer a otra edición de este libro.
This book is for math and computer science majors, for students and representatives of many other disciplines (like bioinformatics, for example) taking courses in graph theory, discrete mathematics, data structures, algorithms. It is also for anyone who wants to understand the basics of graph theory, or just is curious. No previous knowledge in graph theory or any other significant mathematics is required. The very basic facts from set theory, proof techniques and algorithms are sufficient to understand it; but even those are explained in the text. Structurally, the text is divided into two parts where Part II is the generalisation of Part I. The first part discusses the key concepts of graph theory with emphasis on trees, bipartite graphs, cycles, chordal graphs, planar graphs and graph colouring. The second part considers generalisations of Part I and discusses hypertrees, bipartite hypergraphs, hypercycles, chordal hypergraphs, planar hypergraphs and hypergraph colouring. There is an interaction between the parts and within the parts to show how ideas of generalisations work. The main point is to exhibit the ways of generalisations and interactions of mathematical concepts from the very simple to the most advanced. One of the features of this text is the duality of hypergraphs. This fundamental concept is missing in graph theory (and in its introductory teaching) because dual graphs are not properly graphs, they are hypergraphs. However, as Part II shows, the duality is a very powerful tool in understanding, simplifying and unifying many combinatorial relations; it is basically a look at the same structure from the opposite (vertices versus edges) point of view.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Textbooks_Source, Columbia, MO, Estados Unidos de America
hardcover. Condición: New. UK ed. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Nº de ref. del artículo: 001081873N
Cantidad disponible: 17 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 6098780-n
Cantidad disponible: 10 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 6098780
Cantidad disponible: 10 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 6098780-n
Cantidad disponible: 10 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 6098780
Cantidad disponible: 10 disponibles
Librería: moluna, Greven, Alemania
Condición: New. InhaltsverzeichnisPreface Basic Definitions and Concepts Trees and Bipartite Graphs Chordal Graphs Planar Graphs Graph Coloring Traversals and Flows Basic Hypergraph Concepts Hypertrees and Chordal Hypergraphs Some Other Remarka. Nº de ref. del artículo: 2650046902
Cantidad disponible: Más de 20 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. Editor(s): Voloshin, Vitaly I. Num Pages: 287 pages, tables & charts. BIC Classification: PB; U. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 263 x 184 x 23. Weight in Grams: 712. . 2009. Hardback. . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9781606923726
Cantidad disponible: Más de 20 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Editor(s): Voloshin, Vitaly I. Num Pages: 287 pages, tables & charts. BIC Classification: PB; U. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 263 x 184 x 23. Weight in Grams: 712. . 2009. Hardback. . . . . Nº de ref. del artículo: V9781606923726
Cantidad disponible: Más de 20 disponibles