Assertion: graph's clique | /r/HasProperty | solved in polynomial time
Facets:
value: for permutation graphs
type: PURPOSE
Source sentences:
text: the largest clique in a permutation graph corresponds to the longest decreasing subsequence in the permutation defining the graph, so the clique problem may be solved in polynomial time for permutation graphs by using a longest decreasing subsequence algorithm.