Concept
Subgraph isomorphism problem
Related courses (10)
MATH-506: Topology IV.b - cohomology rings
Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
MATH-211: Algebra II - groups
This course deals with group theory, with particular emphasis on group actions and notions of category theory.
MATH-334: Representation theory
Study the basics of representation theory of groups and associative algebras.
ME-427: Networked control systems
This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportun
COM-401: Cryptography and security
This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how
COM-102: Advanced information, computation, communication II
Text, sound, and images are examples of information sources stored in our computers and/or communicated over the Internet. How do we measure, compress, and protect the informatin they contain?
MATH-410: Riemann surfaces
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
MATH-110(a): Advanced linear algebra I - vector spaces
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire (pour les futurs mathématiciens) et de démontrer rigoureusement les résultats principaux de ce sujet.
MATH-111(e): Linear Algebra
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.
MATH-467: Probabilistic methods in combinatorics
The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that