Results 151 to 160 of about 1,056 (209)
On the Edge-length Ratio of Outerplanar Graphs
International audienceWe show that any outerplanar graph admits a planar straight-line drawing such that the length ratio of the longest to the shortest edges is strictly less than $2$. This result is tight in the sense that for any $\epsilon > 0$ there
Lazard, Sylvain +2 more
core
Distinction of Chaos from Randomness Is Not Possible from the Degree Distribution of the Visibility and Phase Space Reconstruction Graphs. [PDF]
Angelidis AK +6 more
europepmc +1 more source
The multi-stripe travelling salesman problem. [PDF]
Çela E, Deineko VG, Woeginger GJ.
europepmc +1 more source
Approximation algorithms for the Maximum Induced Planar and Outerplanar Subgraph problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced.
Graham Farr, Kerri Morgan
core
Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures. [PDF]
Qin J +4 more
europepmc +1 more source
The Tutte polynomial characterizes simple outerplanar graphs
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noble, S. +3 more
core
A distributed geometric rewiring model. [PDF]
Lopez-Chavira MA +4 more
europepmc +1 more source
Geometric assortative growth model for small-world networks. [PDF]
Shang Y.
europepmc +1 more source

