In this paper, we propose a bipartition dual-encoding architecture for low power pipelined circuit. Pipelined circuits consist of combinational logic blocks separated by registers which usually consume a large amount of power. Although the clock gated technique is a promising approach to reduce switching activities of the pipelined registers, this approach is restricted by the placement of the ...

For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP2) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an algo...

This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting Research supported by ESF. Research supported by the Austrian National Research Network S11403-N23 (RiSE) ...

We calculate the bipartite Rényi entanglement entropy of an L× L× 2 bilayer Hubbard model using a determinantal quantum Monte Carlo method recently proposed by Grover [Phys. Rev. Lett. 111, 130402 (2013)]. Two types of bipartition are studied: (i) one that divides the lattice into two L× L planes and (ii) one that divides the lattice into two equal-size (L× L/2 × 2) bilayers. We compare our cal...

Let s = (s1, . . . , sm) and t = (t1, . . . , tn) be vectors of non-negative integervalued functions with equal sum S = ∑m i=1 si = ∑n j=1 tj . Let N(s, t) be the number of m × n matrices with entries from {0, 1} such that the ith row has row sum si and the jth column has column sum tj. Equivalently, N(s, t) is the number of labelled bipartite graphs with degrees of the vertices in one side of ...

Our weighted-tree similarity algorithm matches buyers and sellers in e-Business environments. We use arc-labeled, arc-weighted trees to represent the products (or services) sought/offered by buyers/sellers. Partial product descriptions can be represented via subtrees missing in either or both of the trees. In order to take into account the effect of a missing subtree on the similarity between t...

Let G = (V,E) be a graph. A set S ⊆ V is independent if no two vertices from S are adjacent, and by Ind(G) (Ω(G)) we mean the set of all (maximum) independent sets of G, while α(G) = |S| for S ∈ Ω(G), and core(G) = ∩{S : S ∈ Ω(G)} [6]. The neighborhood of A ⊆ V is denoted by N(A) = {v ∈ V : N(v) ∩ A 6= ∅}, where N(v) is the neighborhood of the vertex v. The number d (X) = |X| − |N(X)| is the di...

A total dominating set of a graph G = (V, E) with no isolated vertex is a set S ⊆ V such that every vertex is adjacent to a vertex in S. A total dominating set S of a graph G is a locating-total dominating set if for every pair of distinct vertices u and v in V − S, N(u) ∩ S 6= N(v) ∩ S, and S is a differentiating-total dominating set if for every pair of distinct vertices u and v in V , N [u]∩...