Michal Tuczynski

most citedCounting independent sets via Divide Measure and Conquer method

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2017

On cordial labeling of hypertrees

Michał Tuczyński, Przemysław Wenus, Krzysztof Węsek

Let $f : V \to Z_{k}$ be a vertex labeling of a hypergraph $H = (V, E)$ . This labeling induces an~edge labeling of $H$ defined by $f (e) = \sum_{v \in e} f (v)$ , where the sum is…

cs.DM2015★ 1 cited

Counting independent sets via Divide Measure and Conquer method

Konstanty Junosza-Szaniawski, Michal Tuczynski

In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time $O^{*} (1.139 4^{n})$ for subcubic graphs and in time $O^*(1.2369^…