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

zbMATH Open1196.05079MaRDI QIDQ3575437FDOQ3575437

Authors: Gruia Calinescu, Cristina G. Fernandes 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/961/0.html

Recommendations

• A new approximation algorithm for finding heavy planar subgraphs
• A Better Approximation Algorithm for Finding Planar Subgraphs
• Two new approximation algorithms for the maximum planar subgraph problem
• scientific article; zbMATH DE number 871895
• On the edge-length ratio of outerplanar graphs

zbMATH Keywords

approximation algorithmsplanar graphsouterplanar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75)

Cited In (2)

• On the edge-length ratio of outerplanar graphs
• An improved algorithm for finding maximum outerplanar subgraphs

This page was built for publication: On the \(k\)-restricted structure ratio in planar and outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575437)