Question

Define the optimization problem LONGEST-PATH-LENGTH as the

relation that associates each instance of an undirected graph and
two vertices with the number of edges in an longest simple path

Answer 1

The optimization problem LONGEST-PATH-LENGTH is defined as the relation that associates each instance of an undirected graph and two vertices with the number of edges in the longest simple path between those vertices.

Step-by-step explanation:

The optimization problem LONGEST-PATH-LENGTH is defined as the relation that associates each instance of an undirected graph and two vertices with the number of edges in the longest simple path between those vertices.