Graph Isomorphisms

Related lectures (26)

Page 1 of 3

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Covers classical and quantum computational complexity concepts and implications.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Covers regular and self-complementary graphs, exploring their properties and examples.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores discrete exponentiation complexity, cyclic groups, and practical cryptography, including popular algorithms like Diffie-Hellman and RSA.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.