On the k-restricted structure ratio in planar and outerplanar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2008

On the k-restricted structure ratio in planar and outerplanar graphs

Abstract

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1 = 2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.
Fichier principal
Vignette du fichier
961-3711-1-PB.pdf (186.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00972327 , version 1 (03-04-2014)

Identifiers

Cite

Gruia Călinescu, Cristina G. Fernandes. On the k-restricted structure ratio in planar and outerplanar graphs. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.135--147. ⟨10.46298/dmtcs.423⟩. ⟨hal-00972327⟩

Collections

TDS-MACS
60 View
739 Download

Altmetric

Share

Gmail Facebook X LinkedIn More