Assertion: graph | /r/CapableOf | construct canonical form
Facets:
value: for the equivalence relation
type: PURPOSE
Source sentences:
text: For biconnected graphs, it can be solved in polynomial time by using the SPQR trees of the graphs to construct a canonical form for the equivalence relation of having a shared mutual dual.