Sign inSign in

Middle first search

A recursive algorithm for finding a path in a graph by guessing a middle node and recursively searching for paths to and from that node.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 1:18:13Hopcroft–Paul–Valiant Theorem

Connections

6

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.