A note on the maximum weight planar subgraph problem

DOI10.21711/231766362020/RMC4615MaRDI QIDQ6492332zbMATH OpenFDO

Authors Diane Castonguay, Elisângela Silva Dias, Leslie Richard Foulds

Publication date 25 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362020/RMC4615

zbMATH Keywords

edge weightgraph operationsmaximum spanning treemaximum weight planar subgraph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Analysis of heuristics for finding a maximum weight planar subgraph
• A new approximation algorithm for finding heavy planar subgraphs
• A Better Approximation Algorithm for Finding Planar Subgraphs
• scientific article; zbMATH DE number 871895
• scientific article; zbMATH DE number 910888

This page was built for publication: A note on the maximum weight planar subgraph problem

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