This is a test
- 386 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
A Java Library of Graph Algorithms and Optimization
Book details
Table of contents
Citations
About This Book
Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access A Java Library of Graph Algorithms and Optimization by Hang T. Lau in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Games. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- Cover
- Title
- Copyright
- The Author
- Contents
- Introduction
- Chapter 1: Random Graph Generation
- Chapter 2: Connectivity
- Chapter 3: Paths and Cycles
- Chapter 4: Planarity Testing
- Chapter 5: Graph Isomorphism Testing
- Chapter 6: Coloring
- Chapter 7: Graph Matching
- Chapter 8: Network Flow
- Chapter 9: Packing and Covering
- Chapter 10: Linear Programming
- Chapter 11: Integer Programming
- Chapter 12: Quadratic Programming
- Appendix A: References
- Appendix B: Graph-Theoretic Terms
- Index of Procedures