An efficient graph planarization two‐phase heuristic

DOI10.1002/NET.3230240203zbMATH Open0789.90083OpenAlexW2089070935MaRDI QIDQ4285458FDOQ4285458

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

Recommendations

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

zbMATH Keywords

NP-completetwo-phase heuristicgraph planarization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited In (10)

• Title not available (Why is that?)
• 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
• Branch-and-bound techniques for the maximum planar subgraph problem^∗
• An analysis of heuristics for graph planarization
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Non-planar core reduction of graphs
• A simulated annealing algorithm for the maximum planar subgraph problem
• Heuristics for the maximum outerplanar subgraph problem
• Title not available (Why is that?)

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)