Generalised Removal
Generalised Removal
In a relevance diagram, generalised removal is the removal of a node, A, preceded by any arrow additions necessary to make its direct predecessors also be direct predecessors of its only direct successor.
Set as favourite
Bookmark
Email this
Comments (0)
Subscribe to this comment's feed
Show/hide commentsWrite comment
Show/hide comment form