1. Home
  2. Material Detail: Discrete Methods

Material Detail

Discrete Methods

Discrete Methods

This volume covers discrete methods in mathematics, including topics such as Pólya’s Enumeration Theorem, basic graph theory, network flows, linear programming, network simplex algorithm, and semidefinite programming. All chapters are accompanied by numerous worked examples, exercises, and detailed step-by-step explanations. Readers may review their knowledge by attempting the exercises at the end of each chapter. Solutions are provided in...

Show More
Keywords:
Trees, Cycle Cancelling Algorithm, Min-Cost Flow, Polya’s Enumeration Theorem, Graph Isomorphism, Simplex Algorithm, NTU Singapore, Discrete Methods, Graph Theory, ASEAN University Network, AUN, Linear Programming, Graph Automorphism
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Open (Access) Textbook
Date Added to MERLOT:
November 28, 2025
Date Modified in MERLOT:
December 2, 2025
Author:
Submitter:
Charlotte Choo
Primary Audience:
College General Ed, College Lower Division
Technical Format:
PDF, Website
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivatives 4.0 International

Browse...

Disciplines with similar materials as Discrete Methods
Other materials like Discrete Methods

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.