Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

Topics include abstract data types (priority queues, dictionaries and graphs) and their implementations, algorithm analysis, sorting, text processing, and object-oriented design.

CS 199 Topics in Computer Science (1-4) A semester-long study of topics in Computer Science. Topics and emphases will vary according to the instructor. This course may be repeated for credit with ...

Graph theory is both an area of mathematics and an important tool in computer science.

Engineers could use this breakthrough in graph theory to design wildly efficient quantum computer chips.

A broad survey of the computer science discipline, focusing on the computer's role in representing, storing, manipulating, organizing and communicating information. Topics include hardware, software, ...

A potential list of topics include the following: Definitions of expander graphs (edge expansion and spectral expansion), equivalence of definitions, the Alon-Boppana theorem, expansion of random ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Topics include set theory, mathematical induction, integers, functions and relations, counting methods, recurrence relations, generating functions, permutations, combinations, principle of inclusion ...