EUR 2,33 per la spedizione in U.S.A.
Destinazione, tempi e costiEUR 3,52 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Feb2215580161738
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 42432140-n
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 42432140
Quantità: Più di 20 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Good. 1. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Codice articolo 0367743752-11-1
Quantità: 1 disponibili
Da: Grand Eagle Retail, Fairfield, OH, U.S.A.
Paperback. Condizione: new. Paperback. Graph Theory: An Introduction to Proofs, Algorithms, and ApplicationsGraph theory is the study of interactions, conflicts, and connections. The relationship between collections of discrete objects can inform us about the overall network in which they reside, and graph theory can provide an avenue for analysis.This text, for the first undergraduate course, will explore major topics in graph theory from both a theoretical and applied viewpoint. Topics will progress from understanding basic terminology, to addressing computational questions, and finally ending with broad theoretical results. Examples and exercises will guide the reader through this progression, with particular care in strengthening proof techniques and written mathematical explanations. Current applications and exploratory exercises are provided to further the readers mathematical reasoning and understanding of the relevance of graph theory to the modern world.FeaturesThe first chapter introduces graph terminology, mathematical modeling using graphs, and a review of proof techniques featured throughout the book The second chapter investigates three major route problems: eulerian circuits, hamiltonian cycles, and shortest paths. The third chapter focuses entirely on trees terminology, applications, and theory. Four additional chapters focus around a major graph concept: connectivity, matching, coloring, and planarity. Each chapter brings in a modern application or approach. Hints and Solutions to selected exercises provided at the back of the book.AuthorKarin R. Saoub is an Associate Professor of Mathematics at Roanoke College in Salem, Virginia. She earned her PhD in mathematics from Arizona State University and BA from Wellesley College. Her research focuses on graph coloring and on-line algorithms applied to tolerance graphs. She is also the author of A Tour Through Graph Theory, published by CRC Press. This text, for the first undergraduate course, will explore major topics in graph theory from both a theoretical and applied viewpoint. Topics will progress from understanding basic terminology, to addressing computational questions, and finally ending with broad theoretical results. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780367743758
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Codice articolo 391533802
Quantità: 3 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9780367743758
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 1st edition NO-PA16APR2015-KAP. Codice articolo 26388098869
Quantità: 3 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9780367743758
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 440 pages. 9.01x5.98x0.98 inches. In Stock. This item is printed on demand. Codice articolo __0367743752
Quantità: 1 disponibili