Related terms:
time complexity
finite graph
monotone polygon
simple polygon
subgraph
acyclic
planar graph
binary search
holds for all
indirect left recursion
reachability relation
lowest common ancestor
may be represented
every simple
vertex of degree
shifts and adds
terminal symbol
transitive reduction
smallest circle
any input
root of the tree
chordal graph
binary decision
Wikipedia sources:
Time complexity
Selection algorithm
Parsing expression grammar
Lexicographic breadth-first search
Smallest circle problem
Dynamic array
Cartesian tree
Monotone polygon
Jewish mythology
Directed acyclic graph
Hasse diagram
Minimum spanning tree
Degeneracy (graph theory)
Planar graph
Polygon triangulation
Multiplication algorithm
Context for words:
linear
time
|
|