A minimization version of a directed subgraph homeomorphism problem

  title={A minimization version of a directed subgraph homeomorphism problem},
  author={Janina A. Brenner and S{\'a}ndor P. Fekete and Jan van der Veen},
  journal={Mathematical Methods of Operations Research},
We consider a special case of the directed subgraph homeomorphism or topological minor 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… 


This work formalizes the CGRA mapping problem as a graph minor containment problem, and introduces additional heuristic strategies that drastically improve the compilation time while still generating optimal or near-optimal mapping solutions.

Graph minor approach for application mapping on CGRAs

  • Liang ChenT. Mitra
  • Computer Science
    2012 International Conference on Field-Programmable Technology
  • 2012
This work transforms the CGRA mapping problem with route sharing into a graph minor problem and provides an efficient framework based on graph mapping to solve this problem and shows higher performance compared to state-of-the-art solutions with better resource utilization and minimal compilation time.

FPGA structures for high speed and low overhead dynamic circuit specialization

The novel technique called parameterized reconfiguration is proposed that can be used to efficiently and automatically implement Dynamic Circuit Specialization (DCS) that is built on top of the Partial Reconfiguration method.



An Approach to the Subgraph Homeomorphism Problem

The subgraph homeomorphism problem

This work presents a linear time algorithm to determine if there exists a simple cycle containing three given nodes in G, a homeomorphic image of a “pattern” graph H in a larger input graph G.

The Directed Subgraph Homeomorphism Problem

Large Topological Cliques in Graphs Without a 4-Cycle

It is proved that every $K_{s,t}-free graph of average degree $r$ contains a subdivision of a complete graph of order $r^{\frac{1}{2}{+}\frac{ 1}{2(s-1)}-o(1)}$.

Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures

The first exact method based on integer linear programming is developed that allows us to achieve provably optimal solutions for two different objective functions, for small to medium instances.

The complexity of satisfiability problems

An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.

Computers and Intractability: A Guide to the Theory of NP-Completeness

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Combinatorial Optimization: Theory and Algorithms

This fourth edition of this comprehensive textbook on combinatorial optimization is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem.

The Complexity of Minimizing Wire Lengths in VLSI Layouts

A Design Environment for Processor-Like Reconfigurable Hardware

This paper describes a design environment that takes into account the three aspects architecture, compiler, and applications, and it presents the basic techniques that are used to realize the compiler.