A minimization version of a directed subgraph homeomorphism problem

We consider a special case of the directed subgraph homeomorphism or topologicalminor problem,where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this application domain, the task is to simultaneously schedule, bind and route a so-called data-flow graph, where vertices represent operations and arcs stand for data dependencies between the operations, given an orthogonal grid structure of reconfigurable processing elements (PEs) that have restricted communication abilities. We show that the problem of simultaneously scheduling, binding and routing is NP-complete by describing a logic engine reduction from NAE-3-SAT. This result holds even when the input graph is a directed tree with maximum indegree two. We also give a |V |3/2-approximation algorithm. J. A. Brenner’s research supported by the DFG Research Center Matheon “Mathematics for key technologies”. J. C. van der Veen’s research supported by DFG Focus Program 1148, “Reconfigurable Architectures”, Grants FE 407/8-1 and FE 407/8-2. J. A. Brenner (B) Institute of Mathematics, Berlin Institute of Technology, Straße des 17. Juni 136, 10623 Berlin, Germany e-mail: [email protected] S. P. Fekete · J. C. van der Veen Algorithms Group, Department of Computer Science, Braunschweig University of Technology, Mühlenpfordtstr. 23, 38106 Braunschweig, Germany e-mail: [email protected] J. C. van der Veen e-mail: [email protected]