Abstract: More and more computing today is built upon Graphs–network-style arrangements of interconnected nodes (called vertices and edges). We introduce graph computing, showing you how to represent graphs, how to navigate them, and how to compute over graphs. We will develop a simple, but one of the most important graph algorithms–computing the shortest path between two nodes (used for example, to determine routes, on social networks, robot motion planning, bayesian networks, the fanciful WunderGraph, etc.)
We’ll also show you examples of pretty graphs!
About the Presenter:
Nuri Halperin: Principal for +N Consulting Inc (Santa Monica, CA), Nuri brings over 15 years of development and leadership experience in internet, E-Commerce and corporate space. He currently serves as Solution Architect focusing on .Net technologies and platforms. Nuri has successfully championed initiatives in ASP.NET, database, data mining, E-commerce, integration projects and custom component development for specific business needs. In recent years Nuri has been active in the coding community, providing training, mentoring and contributing to the coding community, focusing on cutting edge technologies, C# and core framework programming. His passion for efficient computing and his SDLC perspective bring a unique and valuable contribution to every project he engages in. http://www.plusnconsulting.com
Steve Bearman is an independent software developer with his company, Suzy B Studios. He innovates and develops web and client software for all sectors from science and engineering through business and finance-especially the thorny, complex problems where architecture, algorithms, mathematics, innovation, and performance are critical. Always available to help develop software, he often leads development teams. Along the way he has managed both marketing and operations for a manufacturing corporation, taught graduate computer science, and published technical papers dealing with data. He has a special fondness for good algorithms and appropriate technology.