75,550 research outputs found

    The Complexity of Simultaneous Geometric Graph Embedding

    Full text link
    Given a collection of planar graphs G1,…,GkG_1,\dots,G_k on the same set VV of nn vertices, the simultaneous geometric embedding (with mapping) problem, or simply kk-SGE, is to find a set PP of nn points in the plane and a bijection ϕ:V→P\phi: V \to P such that the induced straight-line drawings of G1,…,GkG_1,\dots,G_k under ϕ\phi are all plane. This problem is polynomial-time equivalent to weak rectilinear realizability of abstract topological graphs, which Kyn\v{c}l (doi:10.1007/s00454-010-9320-x) proved to be complete for ∃R\exists\mathbb{R}, the existential theory of the reals. Hence the problem kk-SGE is polynomial-time equivalent to several other problems in computational geometry, such as recognizing intersection graphs of line segments or finding the rectilinear crossing number of a graph. We give an elementary reduction from the pseudoline stretchability problem to kk-SGE, with the property that both numbers kk and nn are linear in the number of pseudolines. This implies not only the ∃R\exists\mathbb{R}-hardness result, but also a 22Ω(n)2^{2^{\Omega (n)}} lower bound on the minimum size of a grid on which any such simultaneous embedding can be drawn. This bound is tight. Hence there exists such collections of graphs that can be simultaneously embedded, but every simultaneous drawing requires an exponential number of bits per coordinates. The best value that can be extracted from Kyn\v{c}l's proof is only 22Ω(n)2^{2^{\Omega (\sqrt{n})}}

    Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems

    Full text link
    We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a class G of graphs, an (F,G)-system is a boolean dynamical system with local transitions functions lying in F and graphs in G. We show that, if local transition functions are given by lookup tables, then the following complexity classification holds: Let F be a class of boolean functions closed under superposition and let G be a graph class closed under taking minors. If F contains all min-functions, all max-functions, or all self-dual and monotone functions, and G contains all planar graphs, then it is #P-complete to compute the number of fixed points in an (F,G)-system; otherwise it is computable in polynomial time. We also prove a dichotomy theorem for the case that local transition functions are given by formulas (over logical bases). This theorem has a significantly more complicated structure than the theorem for lookup tables. A corresponding theorem for boolean circuits coincides with the theorem for formulas.Comment: 16 pages, extended abstract presented at 10th Italian Conference on Theoretical Computer Science (ICTCS'2007

    Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems

    Full text link
    A complete classification of the computational complexity of the fixed-point existence problem for boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function classes F and graph classes G, an (F, G)-system is a boolean dynamical system such that all local transition functions lie in F and the underlying graph lies in G. Let F be a class of boolean functions which is closed under composition and let G be a class of graphs which is closed under taking minors. The following dichotomy theorems are shown: (1) If F contains the self-dual functions and G contains the planar graphs then the fixed-point existence problem for (F, G)-systems with local transition function given by truth-tables is NP-complete; otherwise, it is decidable in polynomial time. (2) If F contains the self-dual functions and G contains the graphs having vertex covers of size one then the fixed-point existence problem for (F, G)-systems with local transition function given by formulas or circuits is NP-complete; otherwise, it is decidable in polynomial time.Comment: 17 pages; this version corrects an error/typo in the 2008/01/24 versio

    Near-best C2C^2 quartic spline quasi-interpolants on type-6 tetrahedral partitions of bounded domains

    Full text link
    In this paper, we present new quasi-interpolating spline schemes defined on 3D bounded domains, based on trivariate C2C^2 quartic box splines on type-6 tetrahedral partitions and with approximation order four. Such methods can be used for the reconstruction of gridded volume data. More precisely, we propose near-best quasi-interpolants, i.e. with coefficient functionals obtained by imposing the exactness of the quasi-interpolants on the space of polynomials of total degree three and minimizing an upper bound for their infinity norm. In case of bounded domains the main problem consists in the construction of the coefficient functionals associated with boundary generators (i.e. generators with supports not completely inside the domain), so that the functionals involve data points inside or on the boundary of the domain. We give norm and error estimates and we present some numerical tests, illustrating the approximation properties of the proposed quasi-interpolants, and comparisons with other known spline methods. Some applications with real world volume data are also provided.Comment: In the new version of the paper, we have done some minor revisions with respect to the previous version, CALCOLO, Published online: 10 October 201

    A survey of statistical network models

    Full text link
    Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a form of graphical representation. Probability models on graphs date back to 1959. Along with empirical studies in social psychology and sociology from the 1960s, these early works generated an active network community and a substantial literature in the 1970s. This effort moved into the statistical literature in the late 1970s and 1980s, and the past decade has seen a burgeoning network literature in statistical physics and computer science. The growth of the World Wide Web and the emergence of online networking communities such as Facebook, MySpace, and LinkedIn, and a host of more specialized professional network communities has intensified interest in the study of networks and network data. Our goal in this review is to provide the reader with an entry point to this burgeoning literature. We begin with an overview of the historical development of statistical network modeling and then we introduce a number of examples that have been studied in the network literature. Our subsequent discussion focuses on a number of prominent static and dynamic network models and their interconnections. We emphasize formal model descriptions, and pay special attention to the interpretation of parameters and their estimation. We end with a description of some open problems and challenges for machine learning and statistics.Comment: 96 pages, 14 figures, 333 reference
    • …
    corecore