scientific article; zbMATH DE number 910888

MaRDI QIDQ4886062zbMATH OpenFDO

Authors Robert J. Cimikowski

Publication date 22 August 1996

zbMATH Keywords

branch-and-cut algorithmmaximum planar subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An analysis of heuristics for graph planarization
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• Analysis of heuristics for finding a maximum weight planar subgraph
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• scientific article; zbMATH DE number 871895

Cited in

(15)

• Analysis of heuristics for finding a maximum weight planar subgraph
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Heuristics for the maximum outerplanar subgraph problem
• Limits of greedy approximation algorithms for the maximum planar subgraph problem
• A note on the practicality of maximal planar subgraph algorithms
• scientific article; zbMATH DE number 434681 (Why is no real title available?)
• scientific article; zbMATH DE number 4145687 (Why is no real title available?)
• Two new approximation algorithms for the maximum planar subgraph problem
• An efficient graph planarization two‐phase heuristic
• An analysis of heuristics for graph planarization
• Linear programming based meta-heuristics for the weighted maximal planar graph
• A simulated annealing algorithm for the maximum planar subgraph problem
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
• A note on the maximum weight planar subgraph problem

This page was built for publication:

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