System level design is increasingly turning towards FPGAs to take advantage of their low cost and fast prototyping. In this paper we present a timing driven partitioning approach for architecturally constrained reconngurable multi-FPGA systems. The partitioning approach using a Path-based clustering based on the attraction function proposed by Kahng et.al 19] followed by FM based min-cut partit...

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polyn...

We consider the maximum integral tWo-Commodity flow problem in augmented planar graphs (i.e., with both source-sink edges added) and provide an o(IVI 2 1ogIVI) algorithm for that problem. Let G = (V, E) be a graph and w : E-t Z+ a weight function. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. Lomonosov gave a good cha...

In this paper we propose an algorithm for approximate inference on graphical models based on belief propagation (BP). Our algorithm is an approximate version of Cutset Conditioning, in which a subset of variables is instantiated to make the rest of the graph singly connected. We relax the constraint of single-connectedness, and select variables one at a time for conditioning, running belief pro...

Circuit partitioning is a very extensively studied problem. In this paper we formulate the problem as a nonlinear program (NLP). The NLP is solved for the objective of minimum cutset size under the constraints of timing. Our proposed methodology easily extends to multiple constraints that are very dominant in the design of large scale VLSI Systems. The NLP is solved using the commercial LP/NLP ...

A graph G is said to be quasi 4 -connected if G is 3-connected and for each cutset K ~ V( G) with IKI = 3, K is the neighbourhood of a vertex of degree three and G K has precisely two components. It is evident that such graphs need not be 4-connected and yet they exhibit many of the properties of 4-connected graphs. In this paper, we show that, given a set, N ~ E( G) of four independent edges, ...

Efficient computation of probabilistic relationships over family pedigrees is an important tool for a variety of problems in genetics, including genetic counseling and linkage analysis. The development of faster and more comprehensive algorithms has preoccupied geneticists for decades [?], and recent general-purpose algorithms for probabilistic inference over arbitrary networks (e.g., [?]) have...

We prove that Multicut in directed graphs, parameterized by the size of the cutset, is W [1]-hard and hence unlikely to be fixed-parameter tractable even if restricted to instances with only four terminal pairs. This negative result almost completely resolves one of the central open problems in the area of parameterized complexity of graph separation problems, posted originally by Marx and Razg...

A major practical limitation of the Maddah-Ali-Niesen coded caching techniques is their high subpacketization level. For the simple network with a single server and multiple users, Yan et al. proposed an alternative scheme with the so-called placement delivery arrays (PDA). Such a scheme requires slightly higher transmission rates but significantly reduces the subpacketization level. In this pa...

Hard and soft precedence constraints play a key role in many application domains. In telecommunications, one application is the configuration of callcontrol feature subscriptions where the task is to sequence a set of user-selected features subject to a set of hard (catalogue) precedence constraints and a set of soft (user-selected) precedence constraints. When no such consistent sequence exist...