Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 114,98
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 130,53
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 114,97
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 123,89
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 147,28
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 276.
Librería: Scarthin Books ABA, ILAB., Cromford, Reino Unido
Original o primera edición
EUR 118,68
Cantidad disponible: 1 disponibles
Añadir al carritoBook Hardcover. Condición: As New. No Jacket. 1st Edition. Springer, 2007. 1st Edition . As New/No Jacket. Book still in original shrink-wrap.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 154,87
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2007
ISBN 10: 3540680195 ISBN 13: 9783540680192
Librería: moluna, Greven, Alemania
EUR 118,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Will serve as a foundation for a variety of useful applications of the graph theory to computer vision, pattern recognition, and related areasCovers a representative set of novel graph-theoretic methods for complex computer vision and pattern reco.
Idioma: Inglés
Publicado por Springer, Berlin, Springer, 2007
ISBN 10: 3540680195 ISBN 13: 9783540680192
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 114,36
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the 'four-color problem' posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other elds.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 166,15
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Publicado por Springer, Berlin, Springer Berlin Heidelberg, Springer, 2007
ISBN 10: 3540680195 ISBN 13: 9783540680192
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the 'four-color problem' posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsst aysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other elds. 266 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 152,23
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 276 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 152,41
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 276.