Category
page 2Graph algorithms
Girvan–Newman algorithm
Community detection algorithm
Courcelle's theorem
on linear-time algorithms for graph logic
transitive reduction
minimal graph with the same reachability relation as a given graph
Stoer–Wagner algorithm
Recursive algorithm in graph theory
B*
In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.
aperiodic graph
directed graph with no integer k > 1 that divides the length of every cycle