scientific article; zbMATH DE number 434681

MaRDI QIDQ3139516zbMATH OpenFDO

Authors Robert J. Cimikowski

Publication date 2 January 1994

zbMATH Keywords

skewnessVLSIcrossing numberNP- completegraph planarization problemmaximum spanning planar subgraph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Skewness and crossing numbers of graphs
• Publication:4886062
• An efficient graph planarization two‐phase heuristic
• An analysis of heuristics for graph planarization
• Skewness of graphs with small cutsets

Cited in

(10)

• scientific article; zbMATH DE number 3877217 (Why is no real title available?)
• On the skewness of Cartesian products with trees
• An efficient graph planarization two‐phase heuristic
• Triangulability of convex graphs and convex skewness
• On the skewness of the join of graphs
• Limits of greedy approximation algorithms for the maximum planar subgraph problem
• Properties of \(\pi\)-skew graphs with applications
• Non-planar core reduction of graphs
• On the skewness of products of graphs
• Skewness of graphs with small cutsets

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