scientific article; zbMATH DE number 3871391

MaRDI QIDQ3338271zbMATH OpenFDO

Authors J. W. Giffin, Les R. Foulds

Publication date 1984

zbMATH Keywords

greedy heuristicmaximum weight planar subgraphgraph planarity testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 4049078
• An algorithm of graph planarity testing and cross minimization
• Testing planarity of partially embedded graphs
• Testing Planarity of Partially Embedded Graphs
• On the linearity of testing planarity of graphs
• Fast minor testing in planar graphs
• Fast minor testing in planar graphs
• A new approach to the linearity of testing planarity of graphs
• Algorithms for multi-level graph planarity testing and layout
• Optimal Upward Planarity Testing of Single-Source Digraphs

Cited in

(3)

• Facilities layout generalized model solved by n-boundary shortest path heuristics
• A linear time algorithm for finding maximal planar subgraphs
• Optimal Upward Planarity Testing of Single-Source Digraphs

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 Q3338271)