This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory.
Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. Subsequent chapters explore cycles and circuits, planarity, matchings, and independence. The text concludes with considerations of special topics and applications and extremal theory. Exercises appear throughout the text.
Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. Subsequent chapters explore cycles and circuits, planarity, matchings, and independence. The text concludes with considerations of special topics and applications and extremal theory. Exercises appear throughout the text.
Pay easily by card, Klarna, Apple Pay or Google Pay. Not happy? You always have a 14-day money-back guarantee. Read more in our terms. If you have any questions, email us at hello@memmo.org.
Memmo makes studying easier – wherever you are in the world. We bring your course books and smart study tools together in one place: summaries, quizzes, podcasts and flashcards. Plus Ted, your study buddy who answers anything you wonder. Over 75,000 students already study here – built to help you learn faster and stress less.
You might also like
Buy the book0