55,245 research outputs found
Binary Decision Diagrams: from Tree Compaction to Sampling
Any Boolean function corresponds with a complete full binary decision tree.
This tree can in turn be represented in a maximally compact form as a direct
acyclic graph where common subtrees are factored and shared, keeping only one
copy of each unique subtree. This yields the celebrated and widely used
structure called reduced ordered binary decision diagram (ROBDD). We propose to
revisit the classical compaction process to give a new way of enumerating
ROBDDs of a given size without considering fully expanded trees and the
compaction step. Our method also provides an unranking procedure for the set of
ROBDDs. As a by-product we get a random uniform and exhaustive sampler for
ROBDDs for a given number of variables and size
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
Many well-known graph drawing techniques, including force directed drawings,
spectral graph layouts, multidimensional scaling, and circle packings, have
algebraic formulations. However, practical methods for producing such drawings
ubiquitously use iterative numerical approximations rather than constructing
and then solving algebraic expressions representing their exact solutions. To
explain this phenomenon, we use Galois theory to show that many variants of
these problems have solutions that cannot be expressed by nested radicals or
nested roots of low-degree polynomials. Hence, such solutions cannot be
computed exactly even in extended computational models that include such
operations.Comment: Graph Drawing 201
- …