Assertion: graph's vertex | /r/Synonym | marrying
Facets:
value: sometimes
type: TEMPORAL
Source sentences:
text: In this context, the moral graph of a DAG is the undirected graph created by adding an (undirected) edge between all parents of the same vertex (sometimes called marrying), and then replacing all directed edges by undirected edges.