On the k-Structure Ratio in Planar and Outerplanar Graphs
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...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Discrete Mathematics & Theoretical Computer Science
2008-08-01
|
| Sarja: | Discrete Mathematics & Theoretical Computer Science |
| Linkit: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/961 |