1,427 research outputs found
Topological Sorting with Regular Constraints
We introduce the constrained topological sorting problem (CTS): given a regular language K and a directed acyclic graph G with labeled vertices, determine if G has a topological sort that forms a word in K. This natural problem applies to several settings, e.g., scheduling with costs or verifying concurrent programs. We consider the problem CTS[K] where the target language K is fixed, and study its complexity depending on K. We show that CTS[K] is tractable when K falls in several language families, e.g., unions of monomials, which can be used for pattern matching. However, we show that CTS[K] is NP-hard for K = (ab)^* and introduce a shuffle reduction technique to show hardness for more languages. We also study the special case of the constrained shuffle problem (CSh), where the input graph is a disjoint union of strings, and show that CSh[K] is additionally tractable when K is a group language or a union of district group monomials. We conjecture that a dichotomy should hold on the complexity of CTS[K] or CSh[K] depending on K, and substantiate this by proving a coarser dichotomy under a different problem phrasing which ensures that tractable languages are closed under common operators
Variations on an ordering theme with constraints
We investigate the problem of nding a total order of a nite set that satis es various local ordering constraints. Depending on the admitted constraints, we provide an e cient algorithm or prove NP-completeness. We discuss several generalisations and systematically classify the problems4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI
Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
The goal of this paper is to introduce a new method in computer-aided
geometry of solid modeling. We put forth a novel algebraic technique to
evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with
regularized operators of union, intersection, and difference, i.e., any CSG
tree. The result is obtained in three steps: first, by computing an independent
set of generators for the d-space partition induced by the input; then, by
reducing the solid expression to an equivalent logical formula between Boolean
terms made by zeros and ones; and, finally, by evaluating this expression using
bitwise operators. This method is implemented in Julia using sparse arrays. The
computational evaluation of every possible solid expression, usually denoted as
CSG (Constructive Solid Geometry), is reduced to an equivalent logical
expression of a finite set algebra over the cells of a space partition, and
solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig
Task-based Augmented Contour Trees with Fibonacci Heaps
This paper presents a new algorithm for the fast, shared memory, multi-core
computation of augmented contour trees on triangulations. In contrast to most
existing parallel algorithms our technique computes augmented trees, enabling
the full extent of contour tree based applications including data segmentation.
Our approach completely revisits the traditional, sequential contour tree
algorithm to re-formulate all the steps of the computation as a set of
independent local tasks. This includes a new computation procedure based on
Fibonacci heaps for the join and split trees, two intermediate data structures
used to compute the contour tree, whose constructions are efficiently carried
out concurrently thanks to the dynamic scheduling of task parallelism. We also
introduce a new parallel algorithm for the combination of these two trees into
the output global contour tree. Overall, this results in superior time
performance in practice, both in sequential and in parallel thanks to the
OpenMP task runtime. We report performance numbers that compare our approach to
reference sequential and multi-threaded implementations for the computation of
augmented merge and contour trees. These experiments demonstrate the run-time
efficiency of our approach and its scalability on common workstations. We
demonstrate the utility of our approach in data segmentation applications
Disentangling agglomeration and network externalities : a conceptual typology
Agglomeration and network externalities are fuzzy concepts. When different meanings are (un)intentionally juxtaposed in analyses of the agglomeration/network externalities-menagerie, researchers may reach inaccurate conclusions about how they interlock. Both externality types can be analytically combined, but only when one adopts a coherent approach to their conceptualization and operationalization, to which end we provide a combinatorial typology. We illustrate the typology by applying a state-of-the-art bipartite network projection detailing the presence of globalized producer services firms in cities in 2012. This leads to two one-mode graphs that can be validly interpreted as topological renderings of agglomeration and network externalities
The Continuing Debate on Deep Molluscan Phylogeny: Evidence for Serialia (Mollusca, Monoplacophora + Polyplacophora)
Molluscs are a diverse animal phylum with a formidable fossil record. Although there is little doubt about the monophyly of the eight extant classes, relationships between these groups are controversial. We analysed a comprehensive multilocus molecular data set for molluscs, the first to include multiple species from all classes, including five monoplacophorans in both extant families. Our analyses of five markers resolve two major clades: the first includes gastropods and bivalves sister to Serialia (monoplacophorans and chitons), and the second comprises scaphopods sister to aplacophorans and cephalopods. Traditional groupings such as Testaria, Aculifera, and Conchifera are rejected by our data with significant Approximately Unbiased (AU) test values. A new molecular clock indicates that molluscs had a terminal Precambrian origin with rapid divergence of all eight extant classes in the Cambrian. The recovery of Serialia as a derived, Late Cambrian clade is potentially in line with the stratigraphic chronology of morphologically heterogeneous early mollusc fossils. Serialia is in conflict with traditional molluscan classifications and recent phylogenomic data. Yet our hypothesis, as others from molecular data, implies frequent molluscan shell and body transformations by heterochronic shifts in development and multiple convergent adaptations, leading to the variable shells and body plans in extant lineages
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
We introduce and study the problem Ordered Level Planarity which asks for a
planar drawing of a graph such that vertices are placed at prescribed positions
in the plane and such that every edge is realized as a y-monotone curve. This
can be interpreted as a variant of Level Planarity in which the vertices on
each level appear in a prescribed total order. We establish a complexity
dichotomy with respect to both the maximum degree and the level-width, that is,
the maximum number of vertices that share a level. Our study of Ordered Level
Planarity is motivated by connections to several other graph drawing problems.
Geodesic Planarity asks for a planar drawing of a graph such that vertices
are placed at prescribed positions in the plane and such that every edge is
realized as a polygonal path composed of line segments with two adjacent
directions from a given set of directions symmetric with respect to the
origin. Our results on Ordered Level Planarity imply -hardness for any
with even if the given graph is a matching. Katz, Krug, Rutter and
Wolff claimed that for matchings Manhattan Geodesic Planarity, the case where
contains precisely the horizontal and vertical directions, can be solved in
polynomial time [GD'09]. Our results imply that this is incorrect unless
. Our reduction extends to settle the complexity of the Bi-Monotonicity
problem, which was proposed by Fulek, Pelsmajer, Schaefer and
\v{S}tefankovi\v{c}.
Ordered Level Planarity turns out to be a special case of T-Level Planarity,
Clustered Level Planarity and Constrained Level Planarity. Thus, our results
strengthen previous hardness results. In particular, our reduction to Clustered
Level Planarity generates instances with only two non-trivial clusters. This
answers a question posed by Angelini, Da Lozzo, Di Battista, Frati and Roselli.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
- …