Results 91 to 100 of about 864 (107)
On the Complexity of Polytope Isomorphism Problems
, 2002 We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time
Kaibel, Volker, Schwartz, Alexander
core +3 more sources
The Convex Mixture Distribution: Granger Causality for Categorical Time Series. [PDF]
SIAM J Math Data Sci, 2021 Tank A, Li X, Fox EB, Shojaie A.
europepmc +1 more source
Connectivity of Triangulation Flip Graphs in the Plane. [PDF]
Discrete Comput Geom, 2022 Wagner U, Welzl E.
europepmc +1 more source
Finite-dimensional flexible algebras associated with directed and weighted CW complexes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaIn this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj +1 more source
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. [PDF]
Algorithmica, 2020 Mnich M, Schlotter I.
europepmc +1 more source
On m-polar fuzzy graph structures. [PDF]
Springerplus, 2016 Akram M, Akmal R, Alshehri N.
europepmc +1 more source
Minimum triplet covers of binary phylogenetic X-trees. [PDF]
J Math Biol, 2017 Huber KT, Moulton V, Steel M.
europepmc +1 more source
The combinatorics of discrete time-trees: theory and open problems. [PDF]
J Math Biol, 2018 Gavryushkin A, Whidden C, Matsen FA.
europepmc +1 more source