Embedding of subsystems limiting length and number of paths between vertexes of computing system graph
We consider a problem of detecting computing system graph components which correspond to the embeddable computing subsystem with respect to reachability and connectivity of its vertexes, and suggest the method of such components’ detection based on projective description of graphs. The approach is illustrated with examples of components’ detection.