Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 46,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 44,11
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 57,48
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 44,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 50,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2007
ISBN 10: 3540735097 ISBN 13: 9783540735090
Librería: moluna, Greven, Alemania
EUR 39,89
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New.
Idioma: Inglés
Publicado por Springer, Berlin, Springer, 2007
ISBN 10: 3540735097 ISBN 13: 9783540735090
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 47,52
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) 'Geometric' properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ('nodal domains'), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology.
Librería: preigu, Osnabrück, Alemania
EUR 41,35
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Laplacian Eigenvectors of Graphs | Perron-Frobenius and Faber-Krahn Type Theorems | Türker Biyikoglu (u. a.) | Taschenbuch | viii | Englisch | 2007 | Springer | EAN 9783540735090 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer, Berlin, Springer Berlin Heidelberg, Springer Jul 2007, 2007
ISBN 10: 3540735097 ISBN 13: 9783540735090
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 42,79
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) 'Geometric' properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ('nodal domains'), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology. 120 pp. Englisch.