Sada Narayanappa (4 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 60.59
US$ 80.75 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Geometric Routing | Theory and practice | Sada Narayanappa | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639202182 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 216.07
US$ 33.40 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 55.03
US$ 56.51 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Narayanappa SadaSada Narayanappa received his Ph.D in Mathematics and Computer Science from the University of Denver in 2006. His research interests include computational geomet…ry, graph theory, algorithms, design and implementati.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 70.94
US$ 70.45 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is provides an insight into the problem of optimal routing in geometric graphs. A geometric graph is a graph in which each node has location information, and edges have some geometrical constraints. The problems considered in t…his book fall into two main categories(1) routing in ad hoc wireless networks (2) routing through weighted regions. The fundamental problem in ad hoc wireless networks is broadcasting messages without flooding and it is modeled on unit disk graphs. The Weighted Region Problem deals with finding an optimal route between two points in the plane, and is modeled on a planar graph where paths are allowed to pass through the faces.
