Results 91 to 100 of about 1,906 (145)

On Edge-Disjoint Maximal Outerplanar Graphs [PDF]

Yuto Okada, Yota Otachi, Lena Volk
openalex   +2 more sources

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, Kratsch D, Paulusma D, Stewart A.   +3 more
europepmc   +1 more source

Charge group partitioning in biomolecular simulation. [PDF]

J Comput Biol, 2013
Canzar S, El-Kebir M, Pool R, Elbassioni K, Mark AE, Geerke DP, Stougie L, Klau GW.   +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, Fricke M, Marz M, Stadler PF, Backofen R.   +4 more
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

Discrete Comput Geom
Aichholzer O, García A, Tejel J, Vogtenhuber B, Weinberger A.   +4 more
europepmc   +1 more source

ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS

ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS
application/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  

A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings [PDF]

, 2017
Thérèse Biedl, Philippe Demontigny
openalex   +1 more source