80,044 research outputs found

    A note on Pr\"ufer-like coding and counting forests of uniform hypertrees

    Full text link
    This note presents an encoding and a decoding algorithms for a forest of (labelled) rooted uniform hypertrees and hypercycles in linear time, by using as few as n2n - 2 integers in the range [1,n][1,n]. It is a simple extension of the classical Pr\"{u}fer code for (labelled) rooted trees to an encoding for forests of (labelled) rooted uniform hypertrees and hypercycles, which allows to count them up according to their number of vertices, hyperedges and hypertrees. In passing, we also find Cayley's formula for the number of (labelled) rooted trees as well as its generalisation to the number of hypercycles found by Selivanov in the early 70's.Comment: Version 2; 8th International Conference on Computer Science and Information Technologies (CSIT 2011), Erevan : Armenia (2011

    Approximately Counting Embeddings into Random Graphs

    Get PDF
    Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices such that every edge is between vertices with different labels and for every vertex all neighbors with a higher label have identical labels. The labeling implicitly generates a sequence of bipartite graphs which permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipartite graphs generated is small and almost all graphs G, the algorithm is a fully polynomial randomized approximation scheme. We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, bounded-degree forests, bounded-length grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs, whereas unbounded-length grid graphs are excluded.Comment: Earlier version appeared in Random 2008. Fixed an typo in Definition 3.

    Fine-grained dichotomies for the Tutte plane and Boolean #CSP

    Get PDF
    Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell, Husfeldt, and Wahl\'en [9] and Husfeldt and Taslaman [12], in combination with Curticapean [7], extended the #P-hardness results to tight lower bounds under the counting exponential time hypothesis #ETH, with the exception of the line y=1y=1, which was left open. We complete the dichotomy theorem for the Tutte polynomial under #ETH by proving that the number of all acyclic subgraphs of a given nn-vertex graph cannot be determined in time exp(o(n))exp(o(n)) unless #ETH fails. Another dichotomy theorem we strengthen is the one of Creignou and Hermann [6] for counting the number of satisfying assignments to a constraint satisfaction problem instance over the Boolean domain. We prove that all #P-hard cases are also hard under #ETH. The main ingredient is to prove that the number of independent sets in bipartite graphs with nn vertices cannot be computed in time exp(o(n))exp(o(n)) unless #ETH fails. In order to prove our results, we use the block interpolation idea by Curticapean [7] and transfer it to systems of linear equations that might not directly correspond to interpolation.Comment: 16 pages, 1 figur

    Improved bounds for the number of forests and acyclic orientations in the square lattice

    Get PDF
    In a recent paper Merino and Welsh (1999) studied several counting problems on the square lattice LnL_n. The authors gave the following bounds for the asymptotics of f(n)f(n), the number of forests of LnL_n, and α(n)\alpha(n), the number of acyclic orientations of LnL_n: 3.209912limnf(n)1/n23.841613.209912 \leq \lim_{n\rightarrow\infty} f(n)^{1/n^2} \leq 3.84161 and 22/7limnα(n)3.7092522/7 \leq \lim_{n\rightarrow\infty} \alpha(n) \leq 3.70925. In this paper we improve these bounds as follows: 3.64497limnf(n)1/n23.741013.64497 \leq \lim_{n\rightarrow\infty} f(n)^{1/n^2} \leq 3.74101 and 3.41358limnα(n)3.554493.41358 \leq \lim_{n\rightarrow\infty} \alpha(n) \leq 3.55449. We obtain this by developing a method for computing the Tutte polynomial of the square lattice and other related graphs based on transfer matrices
    corecore