Decomposing complex network services into fine-grained tasks can make full use of distributed network resources to meet service needs. However, there is a lack of research on end-to-end fine-grained service deployment taking network topologies and location constraints into account. In this paper, we construct a service deployment model with task dependencies, model the service deployment problem as a relaxed subgraph isomorphism problem, and propose a graph matching search strategy to solve it. Simulation results show that the proposed strategy can effectively reduce the average end-to-end delay of services while ensuring resource constraints.