Determinining whether a graph is Hamiltonian (contains a Hamiltonian cycle) is significantly harder than determining whether it is Eulerian. In particular, it is NP-complete.

Personal notes on Graph Theory. Contribute to fzxt/Graph_Theory_Notes development by creating an account on GitHub.

Abstract: We develop a discrete analogue of Hamilton-Jacobi theory in the framework of discrete Hamiltonian mechanics. The resulting discrete Hamilton-Jacobi equation is discrete only in time. The ...

Factor graphs are graphical models with origins in coding theory. The sum-product, the max-product, and the min-sum algorithms, which operate by message passing on a factor graph, subsume a great ...

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.

Some functionalities in Discrete Mathematics include algorithms, set theory, graphs, statements in logic, recursion and probability, and so on.

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.