Results 151 to 160 of about 1,056 (209)

On the Edge-length Ratio of Outerplanar Graphs

open access: yes, 2017
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  

The multi-stripe travelling salesman problem. [PDF]

open access: yesAnn Oper Res, 2017
Çela E, Deineko VG, Woeginger GJ.
europepmc   +1 more source

Approximation algorithms for the Maximum Induced Planar and Outerplanar Subgraph problems

open access: yes, 2008
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  

Quantum Google in a complex network. [PDF]

open access: yesSci Rep, 2013
Paparo GD   +3 more
europepmc   +1 more source

Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures. [PDF]

open access: yesAlgorithms Mol Biol, 2014
Qin J   +4 more
europepmc   +1 more source

The Tutte polynomial characterizes simple outerplanar graphs

open access: yes
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]

open access: yesSci Rep
Lopez-Chavira MA   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy