Local optimization algorithms for maximum planar subgraph

Cites work

scientific article; zbMATH DE number 3904590 (Why is no real title available?)
scientific article; zbMATH DE number 3668651 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 1424309 (Why is no real title available?)
scientific article; zbMATH DE number 7559128 (Why is no real title available?)
A Better Approximation Algorithm for Finding Planar Subgraphs
A Fast, Simpler Algorithm for the Matroid Parity Problem
A deterministic PTAS for the commutative rank of matrix spaces
A note on the practicality of maximal planar subgraph algorithms
A simulated annealing algorithm for the maximum planar subgraph problem
Algebraic algorithms for linear matroid parity problems
An O(m\log n)-Time Algorithm for the Maximal Planar Subgraph Problem
An analysis of heuristics for graph planarization
An augmenting path algorithm for linear matroid parity
Analysis of heuristics for finding a maximum weight planar subgraph
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
Finding triangles for maximum planar subgraphs
Limits of greedy approximation algorithms for the maximum planar subgraph problem
Matching theory
Matroid matching: the power of local search
Maximum planar subgraphs and nice embeddings: Practical layout tools
Maximum series-parallel subgraph
On the k-restricted structure ratio in planar and outerplanar graphs
On the graphic matroid parity problem
Two new approximation algorithms for the maximum planar subgraph problem

This page was built for publication: Local optimization algorithms for maximum planar subgraph

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