Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Longest path problem
Formal sciences
Mathematics
Discrete mathematics
Graph theory
Graph Chatbot
Related lectures (29)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
Dijkstra's Algorithm: All-Pairs
Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.
Networks: Paths
Explains paths in networks, including simple paths and cycles.
Causal Inference: Front Door Criterion
Explains the front door criterion in causal inference and its sufficient conditions for variables blocking paths effectively.
SCION: Next-Generation Internet Security
Presents SCION, a highly secure and efficient next-generation internet architecture with a focus on security and efficiency.
Algorithmic Paradigms for Dynamic Graph Problems
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Magnetostatics: Magnetic Field and Force
Covers magnetic fields, Ampère's law, and magnetic dipoles with examples and illustrations.
Networks: Paths and Components
Explores simple paths, connectivity, equivalence classes, and connected components in directed graphs.
Graphical Definition: Level Sets and Domains
Covers the graphical definition of functions, focusing on level sets and domains.
Theory of Computation: NP Problems Examples
Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.
Designing Algorithms: Recursion and Dynamic Programming
Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.