Abstract
With the algorithm described, it is possible to decompose a directed graph without loops and cycles into subgraphs which have one and only one source, one and only one sink and no other connections to the complement of the subgraph. The algorithm delivers all subgraphs with this property and the hierarchical structure of these subgraphs. Examples and some experiences on computing time are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
