Which marriages in the village will last? Which chicken is queen of the coop? How many crayons do you need to color a county map of Tennessee? What do all of these questions have in common? They’re all graph problems.
Graphs are simultaneously the most intuitive data structure and host to some of the most escoteric algorithms and properties most developers are likely to encounter. Come to this talk for a friendly and approachable introduction to graph theory, application, and implementation.
Tim is a teacher, author, and technology leader with DataStax. He is a conference speaker internationally and in the United States, and contributes to the Denver, Colorado tech community as president of the Denver Open Source User Group. He is the co-presenter of various O’Reilly training videos on topics ranging from Git to Mac OS X Productivity Tips to Apache Cassandra, and is the author of Gradle Beyond the Basics. He blogs very occasionally at timberglund.com, and lives in Littleton, CO, USA with the wife of his youth and their three children.
Help us make this conference the best it can be for you. Have questions you'd like this speaker to address? Suggestions for issues that deserve extra attention? Feedback that you'd like to share with the speaker and other attendees?
Join the conversation here (requires login)
For exhibition and sponsorship opportunities, contact Sharon Cordesse at email@example.com
For information on trade opportunities with O'Reilly conferences contact firstname.lastname@example.org
For media-related inquiries, contact Maureen Jennings at email@example.com
View a complete list of OSCON contacts