next up previous
Next: Up: Previous:

Problems



A problem Q is a binary relation on a set I of instances and a set S of solutions.

Example: Shortest-Path Problem

Instance:
graph G
vertices u and v



Solution:
sequences of vertices (shortest path)


next up previous
Next: Up: Previous: