Results 91 to 100 of about 16,950 (147)
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Discrete Comput Geom, 2016 Aurenhammer F, Walzl G.
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Theory Comput Syst, 2018 Golovach PA +3 more
europepmc +1 more source
The total chord length of maximal outerplanar graphs
We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest path in $\mathcal{C}$ between its endpoints. We define the total chord length of a graph as the sum of lengths of all
Broadus, Haley, Pavelescu, Elena
openaire +2 more sources
Charge group partitioning in biomolecular simulation. [PDF]
J Comput Biol, 2013 Canzar S +7 more
europepmc +1 more source
Interactive implementations of thermodynamics-based RNA structure and RNA-RNA interaction prediction approaches for example-driven teaching. [PDF]
PLoS Comput Biol, 2018 Raden M, Mohamed MM, Ali SM, Backofen R.
europepmc +1 more source
Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures. [PDF]
Algorithms Mol Biol, 2014 Qin J +4 more
europepmc +1 more source
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]
Discrete Comput GeomAichholzer O +4 more
europepmc +1 more source
ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS
ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHSapplication/pdf A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any two adjacent vertices get different colors and that any two different colors appear on the two endpoints of some edge. The achromatic number of ＄G＄ is the largest ＄k＄ such that ＄G＄ has a complete k-coloring.
openaire