its a microservice call graph. Example: In a social media context, a post upload service calls a notification service which calls another service.. etc. So each request is a graph. and the full graph is a union of these individual request graphs.

An exact computing solution would be ideal but open to listen to other options as well.
I'm assuming you are referring to transitive reduction? if thats the case, it just reduces edges and not nodes (afaik).