Results 11 to 20 of about 7,009 (143)
Dynamic programming for graphs on surfaces [PDF]
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
B. Courcelle +15 more
core +1 more source
Combinatorics of tropical Hurwitz cycles [PDF]
We study properties of the tropical double Hurwitz loci defined by Bertram, Cavalieri and Markwig. We show that all such loci are connected in codimension one.
Hampe, Simon
core +1 more source
Polyhedral computational geometry for averaging metric phylogenetic trees [PDF]
This paper investigates the computational geometry relevant to calculations of the Frechet mean and variance for probability distributions on the phylogenetic tree space of Billera, Holmes and Vogtmann, using the theory of probability measures on spaces ...
Miller, Ezra +2 more
core +3 more sources
Parametric shortest-path algorithms via tropical geometry
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Joswig, Michael, Schröter, Benjamin
core +1 more source
Leggett-Garg inequalities and the geometry of the cut polytope [PDF]
The Bell and Leggett-Garg tests offer operational ways to demonstrate that non-classical behavior manifests itself in quantum systems, and experimentalists have implemented these protocols to show that classical worldviews such as local realism and ...
Avis, David +2 more
core +3 more sources
Two series of polyhedral fundamental domains for Lorentz bi-quotients [PDF]
The main aim of this paper is to give two infinite series of examples of Lorentz space forms that can be obtained from Lorentz polyhedra by identification of faces.
Pratoussevitch, Anna, Turki, Nasser Bin
core +2 more sources
A-Tint: A polymake extension for algorithmic tropical intersection theory
In this paper we study algorithmic aspects of tropical intersection theory. We analyse how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry.
Aigner +28 more
core +2 more sources
A curvature theory for discrete surfaces based on mesh parallelity
We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces' areas and mixed areas.
Bobenko, Alexander I. +2 more
core +4 more sources
For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail.
Bakuradze, M. +2 more
core +1 more source
Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction.
Drellich, Elizabeth +5 more
core +1 more source

