An efficient graph planarization two‐phase heuristic

DOI10.1002/NET.3230240203MaRDI QIDQ4285458zbMATH OpenOpenAlexFDO

Authors Olivier Goldschmidt, Alexis Takvorian

Publication date 24 March 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240203

zbMATH Keywords

graph planarizationNP-completetwo-phase heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An analysis of heuristics for graph planarization
• scientific article; zbMATH DE number 910888
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• A Better Approximation Algorithm for Finding Planar Subgraphs
• scientific article; zbMATH DE number 434681

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(12)

• Non-planar core reduction of graphs
• On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
• A heuristic approach towards drawings of graphs with high crossing resolution
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• A new neural network algorithm for planarization problems
• Heuristics for the maximum outerplanar subgraph problem
• scientific article; zbMATH DE number 434681 (Why is no real title available?)
• An analysis of heuristics for graph planarization
• scientific article; zbMATH DE number 1974130 (Why is no real title available?)
• A simulated annealing algorithm for the maximum planar subgraph problem
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• O(n2) algorithms for graph planarization

This page was built for publication: An efficient graph planarization two‐phase heuristic

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