Concept
Subgraph isomorphism problem
Related lectures (63)
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Galois Correspondence
Covers the Galois correspondence, establishing a bijection between certain classes of groups and coverings.
Discrete Exponentiation Complexity
Explores discrete exponentiation complexity, cyclic groups, and practical cryptography, including popular algorithms like Diffie-Hellman and RSA.
Linear Maps and Bases: The Rank Theorem
Covers bijective linear maps, invertibility of matrices, isomorphisms, and the rank theorem.
Bijections Equivariantes
Explores equivariant bijections between groups of automorphisms and the compatibility with group operations.
Algorithms: Problem Solving and Graph Algorithms
Covers elementary graph algorithms, a midterm exam on algorithmic problem-solving, and distance measurement between strings.
Seifert van Kampen: the point
Focuses on the Seifert van Kampen theorem, demonstrating an isomorphism between fundamental groups using a three-dimensional diagram.
Isomorphism in Aut(p)
Explores isomorphism between Aut(p) and a Galois covering through topology course notes.
Networked Control Systems: Consensus Algorithms in Digraphs
Explores consensus algorithms in digraphs, focusing on scenarios where the digraph is not strongly connected.
Statistical Analysis of Network Data: Hypergraphs
Introduces hypergraphs, generalizing graphs by allowing subsets of nodes to form edges and exploring their applications in various fields.