Assertion: graph's decomposition | /r/HasProperty | constructed in linear time
Facets:
value: from the graph
type: OTHER
Source sentences:
text: Any graph has a uniquely recursive decomposition into modules, its modular decomposition, which can be constructed from the graph in linear time; modular decomposition algorithms have applications in other graph algorithms including the recognition of comparability graphs.