Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 28,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 24,91
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 27,80
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 31,55
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New.
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 2022nd edition NO-PA16APR2015-KAP.
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. Locating Eigenvalues in Graphs: Algorithms and Applications. Book.
Da: Revaluation Books, Exeter, Regno Unito
EUR 76,33
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 150 pages. 9.25x6.10x0.39 inches. In Stock.
Editore: Springer International Publishing, 2022
ISBN 10: 3031116976 ISBN 13: 9783031116971
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book focuses on linear time eigenvalue location algorithms for graphs. This subject relates to spectral graph theory, a field that combines tools and concepts of linear algebra and combinatorics, with applications ranging from image processing and data analysis to molecular descriptors and random walks. It has attracted a lot of attention and has since emerged as an area on its own.Studies in spectral graph theory seek to determine properties of a graph through matrices associated with it. It turns out that eigenvalues and eigenvectors have surprisingly many connections with the structure of a graph. This book approaches this subject under the perspective of eigenvalue location algorithms. These are algorithms that, given a symmetric graph matrix M and a real interval I, return the number of eigenvalues of M that lie in I. Since the algorithms described here are typically very fast, they allow one to quickly approximate the value of any eigenvalue, which is a basic step in most applications of spectral graph theory. Moreover, these algorithms are convenient theoretical tools for proving bounds on eigenvalues and their multiplicities, which was quite useful to solve longstanding open problems in the area. This book brings these algorithms together, revealing how similar they are in spirit, and presents some of their main applications.This work can be of special interest to graduate students and researchers in spectral graph theory, and to any mathematician who wishes to know more about eigenvalues associated with graphs. It can also serve as a compact textbook for short courses on the topic.
Da: Majestic Books, Hounslow, Regno Unito
EUR 76,83
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 77,85
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.