18.314 Combinatorial Analysis, Fall 2005
This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal com...
Main Author: | Postnikov, Alexander |
---|---|
Language: | en-US |
Published: |
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/96864 |
Similar Items
-
A Spanning Union of Cycles in Thin Cylinder, Torus and Klein Bottle Grid Graphs
by: Jelena Đokić, et al.
Published: (2023-02-01) -
Proofs that really count : the art of combinatorial proof /
by: 238044 Benjamin, Arthur T., et al.
Published: (2003) -
Solution of three related combinatorial problems by network-flow and "branch and bound" methods,
by: Sprague, Christopher R.
Published: (2009) -
Analysis of combinatorial schemes in the pre-asymptotic region of parameter change
by: Natalia Enatskaya
Published: (2018-06-01) -
Generating functions and enumeration of sequences.
by: Gessel, Ira Martin
Published: (2005)