scientific article
From MaRDI portal
Publication:3866146
zbMath0429.05036MaRDI QIDQ3866146
R. C. Geldmacher, Peter Chuntao Liu
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Maximum planar subgraphs and nice embeddings: Practical layout tools, On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}, Branch-and-bound techniques for the maximum planar subgraph problem∗, A Note on the Practicality of Maximal Planar Subgraph Algorithms, An improved algorithm for finding maximum outerplanar subgraphs, On the skewness of products of graphs, Finding large planar subgraphs and large subgraphs of a given genus, Unnamed Item, Finding Triangles for Maximum Planar Subgraphs, On the skewness of the join of graphs, A branch-and-cut approach to the crossing number problem, Skewness of generalized Petersen graphs and related graphs, SPLITTING NUMBER is NP-complete, On maximum planar induced subgraphs, Properties of \(\pi\)-skew graphs with applications, Non-planar core reduction of graphs, Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem, On finding a biconnected spanning planar subgraph with applications to the facilities layout problem, Unnamed Item, Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs, Unnamed Item, On the skewness of Cartesian products with trees, An effective crossing minimisation heuristic based on star insertion, Heuristics for the maximum outerplanar subgraph problem, Analysis of heuristics for finding a maximum weight planar subgraph, Remarks on the thickness and outerthickness of a graph