Combinatorial structures encompass an array of discrete objects—permutations, set partitions, matchings, trees and lattice paths—whose enumeration and intrinsic properties are often captured by ...

Covers topics in discrete mathematics with applications within computer science. Some of the topics to be covered include graphs and matrices; principles of logic and induction; number theory; ...

Programming in assembly language and C for students with prior experience in Java. Topics include binary number encodings, instruction set architecture, assembly language programming, and instruction ...

Variational methods on graphs extend the classical calculus of variations to discrete structures, treating vertices and edges as the domain for differential‐like operators. By associating an energy ...